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

DOI10.2996/KMJ/1467830136zbMATH Open1398.12004OpenAlexW2465585989MaRDI QIDQ309665FDOQ309665

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds for polynomials using geometric programming
• A Sufficient Condition for All the Roots of a Polynomial To Be Real
• Sufficient conditions for a real polynomial to be a sum of squares

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)