THE MOMENT-SOS HIERARCHY

DOI10.1142/9789813272880_0200zbMath1451.90130arXiv1808.03446OpenAlexW2972701999MaRDI QIDQ5122176

Jean-Bernard Lasserre

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationsemidefinite relaxationspositive polynomials\(K\)-moment problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Moment problems (44A60) Semialgebraic sets and related spaces (14P10)

Related Items (6)

The saddle point problem of polynomials ⋮ Optimization on the Euclidean Unit Sphere ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization ⋮ Computing the Hausdorff Boundary Measure of Semialgebraic Sets ⋮ Semi-algebraic approximation using Christoffel-Darboux kernel ⋮ Probability estimation via policy restrictions, convexification, and approximate sampling

This page was built for publication: THE MOMENT-SOS HIERARCHY