2014-12-01
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
Publication
Publication
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
| Additional Metadata | |
|---|---|
| , , | |
| Cornell University Library | |
| arXiv.org e-Print archive | |
| Semidefinite programming and combinatorial optimization | |
| Organisation | 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. In arXiv.org e-Print archive (ArXiv:1411.6867v3). Cornell University Library. |
|
