# A survey of hidden convex optimization

**Authors:** Yong Xia

arXiv: 1902.10921 · 2019-03-01

## TL;DR

This survey reviews methods to uncover hidden convex structures in nonconvex optimization problems, highlighting their importance and discussing open challenges in the field.

## Contribution

It systematically summarizes three key approaches for revealing convexity in nonconvex problems and identifies ten open research questions.

## Key findings

- Three main methods for hidden convexification are summarized.
- Highlights the significance of convex structures in nonconvex problems.
- Raises ten open problems for future research.

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1902.10921/full.md

## References

94 references — full list in the complete paper: https://tomesphere.com/paper/1902.10921/full.md

---
Source: https://tomesphere.com/paper/1902.10921