A survey of hidden convex optimization
classification
🧮 math.OC
keywords
optimizationproblemsconvexhiddennonconvexsurveyclassesdifferent
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.