Y. Xia. (2019)cite arxiv:1902.10921Comment: 25 pages.
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.
Description
[1902.10921] A survey of hidden convex optimization
%0 Journal Article
%1 xia2019survey
%A Xia, Yong
%D 2019
%K convex optimization
%T A survey of hidden convex optimization
%U http://arxiv.org/abs/1902.10921
%X 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.
@article{xia2019survey,
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.},
added-at = {2019-03-01T15:23:54.000+0100},
author = {Xia, Yong},
biburl = {https://www.bibsonomy.org/bibtex/298c0c6b653bbd8e964ccbb5f945b3661/kirk86},
description = {[1902.10921] A survey of hidden convex optimization},
interhash = {7d6fe466fc7cd57c7bd4f2ff5fa6972f},
intrahash = {98c0c6b653bbd8e964ccbb5f945b3661},
keywords = {convex optimization},
note = {cite arxiv:1902.10921Comment: 25 pages},
timestamp = {2019-03-01T15:23:54.000+0100},
title = {A survey of hidden convex optimization},
url = {http://arxiv.org/abs/1902.10921},
year = 2019
}