Identification of Hidden Convex Minimization Problems

Abstract

If a nonconvex minimization problem can be converted into an equivalent convex minimization problem, the primal nonconvex minimization problem is called a hidden convex minimization problem. Sufficient conditions are developed in this paper to identify such hidden convex minimization problems. Hidden convex minimization problems possess the same desirable property as convex minimization problems: Any lo- cal minimum is also a global minimum. Identification of hidden convex minimization problem extends the reach of global optimization.KeywordsConvex programmingnonconvex optimizationglobal optimizationconvexification