Representations of non-negative polynomials via KKT ideals

DOI10.4064/AP102-2-1MaRDI QIDQ3090342zbMATH OpenOpenAlexFDO

Authors Dang Tuan Hiep

Publication date 29 August 2011

Published in Annales Polonici Mathematici (Search for Journal in Brave)

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

zbMATH Keywords

semidefinite programming (SDP)non-negative polynomialssum of squares (SOS)optimization of polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25)

Abstract: This paper studies the representations of a non-negative polynomial $f$ on a non-compact semi-algebraic set $K$ modulo its critical ideal. Under the assumptions that the semi-algebraic set $K$ is regular and $f$ satisfies the boundary Hessian conditions (BHC) at each zero of $f$ in $K$, we show that $f$ can be represented as a sum of squares (SOS) of real polynomials modulo its critical ideal if $fge0$ on $K$. In particular, we focus on the polynomial ring $mathbbR[x]$.

Recommendations

• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Minimizing polynomials on noncompact sets
• Representations of positive polynomials and optimization on noncompact semialgebraic sets
• Distinguished representations of non-negative polynomials

Cited in

(2)

• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Representation of nonnegative convex polynomials

This page was built for publication: Representations of non-negative polynomials via KKT ideals

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