Lower bounds for a polynomial in terms of its coefficients

DOI10.1007/s00013-010-0179-0zbMath1205.12001OpenAlexW2105100124MaRDI QIDQ604214

Mehdi Ghasemi, Murray A. Marshall

Publication date: 10 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00013-010-0179-0

zbMATH Keywords

optimizationsums of squarespositive polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Real algebra (13J30)

Related Items (4)

Lower bounds on the global minimum of a polynomial ⋮ Positive semidefinite diagonal minus tail forms are sums of squares ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ A generalization of a microlocal version of Bochner’s theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive semidefinite diagonal minus tail forms are sums of squares
• Sufficient conditions for a real polynomial to be a sum of squares
• Global Optimization with Polynomials and the Problem of Moments
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Bounds for the Zeros of Polynomials

This page was built for publication: Lower bounds for a polynomial in terms of its coefficients