Polynomial Programming: LP-Relaxations Also Converge

DOI10.1137/040603942zbMath1114.90086OpenAlexW2079089353MaRDI QIDQ5317502

Jean-Bernard Lasserre

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/040603942

zbMATH Keywords

global optimizationlinear programming relaxationsreal algebraic geometrysemidefinite programming relaxations

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (12)

LP relaxations for a class of linear semi-infinite programming problems ⋮ Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets ⋮ A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem ⋮ A linear programming reformulation of the standard quadratic optimization problem ⋮ (Global) optimization: historical notes and recent developments ⋮ Exact relaxations of non-convex variational problems ⋮ Numerical multilinear algebra and its applications ⋮ A revised Taha's algorithm for polynomial 0-1 programming ⋮ Introduction to Semidefinite, Conic and Polynomial Optimization ⋮ A “Joint+Marginal” Approach in Optimization ⋮ Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems

This page was built for publication: Polynomial Programming: LP-Relaxations Also Converge