Convergence analysis for Lasserre’s measure-based hierarchy of upper bounds for polynomial optimization
- 12 July 2016
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 162 (1-2) , 363-392
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- A New Look at Nonnegativity on Closed Sets and Polynomial OptimizationSIAM Journal on Optimization, 2011
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the HypercubeSIAM Journal on Optimization, 2010
- GloptiPoly 3: moments, optimization and semidefinite programmingOptimization Methods and Software, 2009
- On the complexity of optimization over the standard simplexEuropean Journal of Operational Research, 2008
- On the complexity of Putinar's PositivstellensatzJournal of Complexity, 2007
- A PTAS for the minimization of polynomials of fixed degree over the simplexTheoretical Computer Science, 2006
- On the complexity of Schmüdgen's PositivstellensatzJournal of Complexity, 2004
- Global Optimization with Polynomials and the Problem of MomentsSIAM Journal on Optimization, 2001
- Invariant Integration Formulas for the n-Simplex by Combinatorial MethodsSIAM Journal on Numerical Analysis, 1978
- A Derivation of n-Dimensional Spherical CoordinatesThe American Mathematical Monthly, 1960