Convergence of Lasserre's hierarchy: the general case

DOI10.1007/s11590-021-01757-6zbMath1489.90108arXiv2011.08139OpenAlexW3175509097MaRDI QIDQ2119755

Matteo Tacchi

Publication date: 30 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.08139

zbMATH Keywords

convex optimizationsemidefinite programmingduality theorynumerical analysisLasserre hierarchyinfinite-dimensional optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Polynomial optimization (90C23)

Uses Software

• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Functional analysis, Sobolev spaces and partial differential equations
• A moment approach for entropy solutions to nonlinear hyperbolic PDEs
• Global Optimization with Polynomials and the Problem of Moments
• Convex Computation of the Region of Attraction of Polynomial Control Systems
• GloptiPoly 3: moments, optimization and semidefinite programming
• Approximate Volume and Integration for Basic Semialgebraic Sets
• Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems
• Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
• Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
• Strong duality in lasserre's hierarchy for polynomial optimization

This page was built for publication: Convergence of Lasserre's hierarchy: the general case