Representation of nonnegative convex polynomials

DOI10.1007/s00013-008-2687-8zbMath1159.14033arXiv0801.3754OpenAlexW2028123920MaRDI QIDQ944212

Jean-Bernard 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) Sums of squares and representations by other particular quadratic forms (11E25) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Semialgebraic sets and related spaces (14P10)

Related Items (7)

Convexifying Positive Polynomials and Sums of Squares Approximation ⋮ Positivstellensatz for homogeneous semialgebraic sets ⋮ Exact SDP relaxations for classes of nonlinear semidefinite programming problems ⋮ NP-hardness of deciding convexity of quartic polynomials and related problems ⋮ Exact conic programming relaxations for a class of convex polynomial cone programs ⋮ 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

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