Positive semidefinite diagonal minus tail forms are sums of squares
From MaRDI portal
(Redirected from Publication:658336)
Recommendations
Cites work
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A quantitative version of Hurwitz' theorem on the arithmetic-geometric inequality.
- An algorithm for sums of squares of real polynomials
- Forms derived from the arithmetic-geometric inequality
- Lower bounds for a polynomial in terms of its coefficients
- Modern Multiplier Rules
- Positive polynomials and sums of squares
- SOS approximations of nonnegative polynomials via simple high degree perturbations
- Semidefinite programming relaxations for semialgebraic problems
- Sufficient conditions for a real polynomial to be a sum of squares
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(18)- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- The Laplacian of a uniform hypergraph
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Positive semidefinite forms and sums of squares
- Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
- On sums of squares of \(K\)-nomials
- Lower bounds on the global minimum of a polynomial
- Minkowski's inequality and sums of squares
- High-order sum-of-squares structured tensors: theory and applications
- Sufficient conditions for a real polynomial to be a sum of squares of polynomials
- Further results on sum-of-squares tensors
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Lower bounds for a polynomial in terms of its coefficients
This page was built for publication: Positive semidefinite diagonal minus tail forms are sums of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658336)