arXiv Open Access 2019

A survey of hidden convex optimization

Yong Xia

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.OC

Penulis (1)

Yong Xia

Format Sitasi

APA MLA BibTeX

Xia, Y. (2019). A survey of hidden convex optimization. https://arxiv.org/abs/1902.10921

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2019
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓