Sufficient conditions for a real polynomial to be a sum of squares of polynomials

DOI10.2996/KMJ/1467830136MaRDI QIDQ309665zbMATH OpenOpenAlexFDO

Authors Van Doat Dang, Thi Thao Nguyen

Publication date 7 September 2016

Published in Kodai Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.kmj/1467830136

zbMATH Keywords

global optimizationbarycentric coordinatespositive polynomialsum of squaresNewton polyhedronframeworkgeometric programmingmediated set

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Recommendations

• Lower bounds for polynomials using geometric programming
• Lower bounds for a polynomial in terms of its coefficients
• Sufficient conditions for a real polynomial to be a sum of squares
• Positive semidefinite forms and sums of squares
• Positive semidefinite diagonal minus tail forms are sums of squares

Cited in

(5)

• A Sufficient Condition for All the Roots of a Polynomial To Be Real
• scientific article; zbMATH DE number 5596987 (Why is no real title available?)
• Sufficient conditions for a real polynomial to be a sum of squares
• scientific article; zbMATH DE number 4130497 (Why is no real title available?)
• Lower bounds for polynomials using geometric programming

This page was built for publication: Sufficient conditions for a real polynomial to be a sum of squares of polynomials

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