Optimisation globale et théorie des moments

DOI10.1016/S0764-4442(00)01750-XzbMath1016.90031OpenAlexW1969686104MaRDI QIDQ4763181

Jean-Bernard Lasserre

Publication date: 27 March 2001

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0764-4442(00)01750-x

zbMATH Keywords

compact semialgebraic setconstrained global minimumconvex positive semidefinite programsreal-valued polynomial map

Mathematics Subject Classification ID

Semidefinite programming (90C22) Semialgebraic sets and related spaces (14P10)

Related Items (14)

Representations of non-negative polynomials having finitely many zeros ⋮ SOS Is Not Obviously Automatizable, Even Approximately ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ Finding largest small polygons with gloptipoly ⋮ Design of Marx generators as a structured eigenvalue assignment ⋮ Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables ⋮ Convergence rates of moment-sum-of-squares hierarchies for optimal control problems ⋮ A survey on conic relaxations of optimal power flow problem ⋮ A MAX-CUT formulation of 0/1 programs ⋮ Strong duality in lasserre's hierarchy for polynomial optimization ⋮ Positivity and Optimization: Beyond Polynomials ⋮ A Striktpositivstellensatz for measurable functions ⋮ Hypercontractive inequalities via SOS, and the Frankl--Rödl graph ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm

This page was built for publication: Optimisation globale et théorie des moments