Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method

DOI10.1145/1837934.1837979zbMath1321.65077OpenAlexW2154406034MaRDI QIDQ2946543

Sharon Hutton, Erich L. Kaltofen, Lihong Zhi

Publication date: 17 September 2015

Published in: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1837934.1837979

zbMATH Keywords

semidefinite programmingsum-of-squaresapproximate polynomial systemsnearest polynomial with a real rootnumeric polynomial inequality

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Numerical computation of roots of polynomial equations (65H04)

Related Items

Overdetermined Weierstrass iteration and the nearest consistent system

Uses Software

• DIFFALG
• AIDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential algebra for derivations with nontrivial commutation rules
• Generating differential invariants
• Projective-type differential invariants and geometric curve evolutions of KdV-type in flat homogeneous manifolds
• Smooth and algebraic invariants of a group action: Local and global constructions
• Differential invariants of a Lie group action: syzygies on a generating set
• Invariants différentiels d'un pseudogroupe de Lie. I
• Invariants différentiels d'un pseudogroupe de Lie. II
• Higher order contact of submanifolds of homogeneous spaces
• Moving coframes. II: Regularization and theoretical foundations
• Rational invariants of a group action. Construction and rewriting
• Differential invariants of conformal and projective surfaces