We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864 − 885], obtained by searching for an optimal pro
Polynomial optimization · Semidefinite optimization · Lasserre hierarchy
Logistics (theme 3)
Cornell University Library
arXiv.org e-Print archive
Semidefinite programming and combinatorial optimization
Networks and Optimization

de Klerk, E, Laurent, M, & Sun, Z. (2014). Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization. arXiv.org e-Print archive. Cornell University Library .