Positive semidefinite diagonal minus tail forms are sums of squares

DOI10.1007/s00209-010-0753-yzbMath1271.11045MaRDI QIDQ658336

Carla Fidalgo, Alexander Kovačec

Publication date: 12 January 2012

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/11199

zbMATH Keywords

sums of squares; positive semidefinite forms; Diagonal minus tail forms; sums of binomial and monomial squares

Mathematics Subject Classification ID

11E25: Sums of squares and representations by other particular quadratic forms

12D15: Fields related with sums of squares (formally real fields, Pythagorean fields, etc.)

Related Items

Further results on sum-of-squares tensors, Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks, Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors, Amoebas, nonnegative polynomials and sums of squares supported on circuits, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming, Lower bounds on the global minimum of a polynomial, Lower bounds for a polynomial in terms of its coefficients, On sums of squares of \(K\)-nomials, An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, High-order sum-of-squares structured tensors: theory and applications, The Laplacian of a uniform hypergraph, Minkowski's inequality and sums of squares, Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for a polynomial in terms of its coefficients
• SOS approximations of nonnegative polynomials via simple high degree perturbations
• Forms derived from the arithmetic-geometric inequality
• An algorithm for sums of squares of real polynomials
• Semidefinite programming relaxations for semialgebraic problems
• Sufficient conditions for a real polynomial to be a sum of squares
• Modern Multiplier Rules
• A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality.