- Title
- Peeling off a nonconvex cover of an actual convex problem: Hidden convexity
- Creator
- Wu, Zhiyou; Li, Duan; Zhang, Lian-Sheng; Yang, Xin-Min
- Date
- 2007
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/62438
- Identifier
- vital:955
- Identifier
-
https://doi.org/10.1137/050648584
- Identifier
- ISSN:1052-6234
- Abstract
- Convexity is, without a doubt, one of the most desirable features in optimization. Many optimization problems that are nonconvex in their original settings may become convex after performing certain equivalent transformations. This paper studies the conditions for such hidden convexity. More specifically, some transformation-independent sufficient conditions have been derived for identifying hidden convexity. The derived sufficient conditions are readily verifiable for quadratic optimization problems. The global minimizer of a hidden convex programming problem can be identified using a local search algorithm. © 2007 Society for Industrial and Applied Mathematics.; C1
- Publisher
- Society for Industrial and Applied Mathematics
- Relation
- SIAM Journal on Optimization Vol. 18, no. 2 (2007), p. 507-536
- Rights
- Copyright Society for Industrial and Applied Mathematics
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Convexity; Global optimisation; Hidden convexity; Hidden-convex function; Hidden-convex programming problem
- Reviewed
- Hits: 702
- Visitors: 677
- Downloads: 0