Back to Search Start Over

PEELING OFF A NONCONVEX COVER OF AN ACTUAL CONVEX PROBLEM: HIDDEN CONVEXITY.

PEELING OFF A NONCONVEX COVER OF AN ACTUAL CONVEX PROBLEM: HIDDEN CONVEXITY.

Authors :
Wu, Z. Y.
Li, D.
Zhang, L. S.
Yang, X. M.
Source :
SIAM Journal on Optimization. 2007, Vol. 18 Issue 2, p507-536. 30p.
Publication Year :
2007

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 axe readily verifiable for quadratic optimization problems. The global minimizer of a hidden convex programming problem can be identified using a local search algorithm. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10526234
Volume :
18
Issue :
2
Database :
Academic Search Index
Journal :
SIAM Journal on Optimization
Publication Type :
Academic Journal
Accession number :
32533757
Full Text :
https://doi.org/10.1137/050648584