A survey of hidden convex optimization
arXiv:1902.10921
Abstract
Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems. Finally, ten open problems are raised.
25 pages
References in corpus (5)
- S-Lemma with Equality and Its Applications
- A Second-Order Cone Based Approach for Solving the Trust Region Subproblem and Its Variants
- Strong Duality for Generalized Trust Region Subproblem: S-Lemma with Interval Bounds
- Trust Region Subproblem with a Fixed Number of Additional Linear Inequality Constraints has Polynomial Complexity
- On the p-regularized trust region subproblem