Representation of nonnegative convex polynomials

DOI10.1007/S00013-008-2687-8MaRDI QIDQ944212zbMATH OpenOpenAlexFDO

Authors Jean B. Lasserre

Publication date 12 September 2008

Published in Archiv der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

sums of squaresconvex setsquadratic modulesPositive polynomials

Mathematics Subject Classification ID

Convex programming (90C25) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Abstract: We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the concave polynomials that define K.

Recommendations

• Distinguished representations of non-negative polynomials
• Convex sets with semidefinite representation
• scientific article; zbMATH DE number 1944285
• Convexifying positive polynomials and sums of squares approximation
• Representations of non-negative polynomials via KKT ideals

Cited in

(15)

• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
• A convex polynomial that is not sos-convex
• Representing polynomials by positive linear functions on compact convex polyhedra
• Distinguished representations of strictly positive polynomials
• Higher-order Newton methods with polynomial work per iteration
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Complexity estimates for representations of Schmüdgen type.
• Positivstellensatz for homogeneous semialgebraic sets
• scientific article; zbMATH DE number 1944285 (Why is no real title available?)
• scientific article; zbMATH DE number 1664584 (Why is no real title available?)
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Convexifying positive polynomials and sums of squares approximation
• Distinguished representations of non-negative polynomials
• Exact conic programming relaxations for a class of convex polynomial cone programs

This page was built for publication: Representation of nonnegative convex polynomials

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