Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김선영 | * |
dc.date.accessioned | 2016-08-28T11:08:25Z | - |
dc.date.available | 2016-08-28T11:08:25Z | - |
dc.date.issued | 2003 | * |
dc.identifier.issn | 0453-4514 | * |
dc.identifier.other | OAK-1577 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/219266 | - |
dc.description.abstract | The class of POPs (Polynomial Optimization Problems) over cones covers a wide range of optimization problems such as 0-1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. This paper presents a new framework for convex relaxation of POPs over cones in terms of linear optimization problems over cones. It provides a unified treatment of many existing convex relaxation methods based on the lift-and-project linear programming procedure, the reformulation-linearization technique and the semidefinite programming relaxation for a variety of problems. It also extends the theory of convex relaxation methods, and thereby brings flexibility and richness in practical use of the theory. | * |
dc.language | English | * |
dc.title | A general framework for convex relaxation of polynomial optimization problems over cones | * |
dc.type | Article | * |
dc.relation.issue | 2 | * |
dc.relation.volume | 46 | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 125 | * |
dc.relation.lastpage | 144 | * |
dc.relation.journaltitle | Journal of the Operations Research Society of Japan | * |
dc.identifier.wosid | WOS:000184810000001 | * |
dc.identifier.scopusid | 2-s2.0-0242592654 | * |
dc.author.google | Kojima M. | * |
dc.author.google | Kim S. | * |
dc.author.google | Waki H. | * |
dc.contributor.scopusid | 김선영(57221275622) | * |
dc.date.modifydate | 20231116113048 | * |