Optimisation globale et théorie des moments

DOI10.1016/S0764-4442(00)01750-XzbMATH Open1016.90031OpenAlexW1969686104MaRDI QIDQ4763181FDOQ4763181

Authors: Jean B. 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

Recommendations

• Global optimization with polynomials and the problem of moments
• Global optimization of polynomials over real algebraic sets
• On global optimizations with polynomials
• Optimization of Polynomial Functions
• An introduction to polynomial and semi-algebraic optimization

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)

Cited In (26)

• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Strong duality in lasserre's hierarchy for polynomial optimization
• Optimization of Polynomials on Compact Semialgebraic Sets
• On global optimizations with polynomials
• Positivity and optimization: beyond polynomials
• Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
• Lasserre hierarchy for large scale polynomial optimization in real and complex variables
• The moment-SOS hierarchy: applications and related topics
• Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
• A survey on conic relaxations of optimal power flow problem
• Sums of squares, moment matrices and optimization over polynomials
• A Striktpositivstellensatz for measurable functions
• On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and Applications
• Representations of non-negative polynomials having finitely many zeros
• Design of Marx generators as a structured eigenvalue assignment
• Finding largest small polygons with gloptipoly
• The moment-SOS hierarchy and the Christoffel-Darboux kernel
• Global optimization with polynomials and the problem of moments
• The method of moments in global optimization
• An approach to obtaining global extremums in polynomial mathematical programming problems
• Moments and sums of squares for polynomial optimization and related problems
• A MAX-CUT formulation of 0/1 programs
• SOS is not obviously automatizable, even approximately
• Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
• Global optimization in Hilbert space
• Global optimization of polynomials restricted to a smooth variety using sums of squares

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763181)