A survey of hidden convex optimization
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 28 Feb 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.