Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares

DOI10.1137/080719212zbMath1163.13020OpenAlexW1984903186MaRDI QIDQ3629529

Tiên Sȯn Phạm, Ha Huy Vui

Publication date: 27 May 2009

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

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

zbMATH Keywords

global optimizationpolynomialssum of squares (SOS)semidefinite program (SDP)tangency variety

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Computational aspects and applications of commutative rings (13P99) Semialgebraic sets and related spaces (14P10) Real algebra (13J30)

Related Items (20)

Toward effective detection of the bifurcation locus of real polynomial maps ⋮ Stability and genericity for semi-algebraic compact programs ⋮ Reaching generalized critical values of a polynomial ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness ⋮ Tangencies and polynomial optimization ⋮ Homogenization for polynomial optimization with unbounded sets ⋮ (Global) optimization: historical notes and recent developments ⋮ An exact Jacobian SDP relaxation for polynomial optimization ⋮ Generic Properties for Semialgebraic Programs ⋮ A Frank-Wolfe type theorem for nondegenerate polynomial programs ⋮ On polynomial optimization over non-compact semi-algebraic sets ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems ⋮ Detecting bifurcation values at infinity of real polynomials ⋮ Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero ⋮ Solving polynomial optimization problems via the truncated tangency variety and sums of squares ⋮ Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\) ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions

This page was built for publication: Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares