Convexity in polynomial optimization

Jean B. LasserreCambridge 2015 · DOI · OpenAlex

Abstract

The moment-SOS approach described in Chapter 6 as well as its extensions in Chapter 11 aim at solving difficult nonconvex (and in general NP-hard) optimization problems. On the other hand, a large class of convex optimization problems can be solved efficiently and sometimes in time polynomial in the input size of the problem. Therefore the moment-SOS approach should have the highly desirable feature of somehow recognizing “easy” problems, for example convex problems. That is, when applied to such problems it should show some significant improvement or a particular nice behavior not necessarily valid in the general case. Otherwise
BibTeX
@inproceedings{lasserre2015convexity,
  author = {Jean B. Lasserre},
  title = {{Convexity in polynomial optimization}},
  booktitle = {Cambridge},
  year = {2015},
  doi = {10.1017/cbo9781107447226.014},
}

Loading related content...

Figure