科研之友
微信
新浪微博
Facebook
分享链接
摘要
This paper illustrates the fundamental connection between nonconvex quadratic optimization and copositive optimization-a connection that allows the reformulation of nonconvex quadratic problems as convex ones in a unified way. We focus on examples having just a few variables or a few constraints for which the quadratic problem can be formulated as a copositive-style problem, which itself can be recast in terms of linear, second-order-cone, and semidefinite optimization. A particular highlight is the role played by the geometry of the feasible set.
- 出版日期2015-6
