An improved algorithm for deciding semi-definite polynomials

DOI10.1016/J.JALGEBRA.2014.06.021MaRDI QIDQ404554zbMATH OpenOpenAlexFDO

Authors Shuijing Xiao, Xiaoning Zeng, Guangxing Zeng

Publication date 4 September 2014

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgebra.2014.06.021

zbMATH Keywords

triangular decompositiontransfer principlesemi-algebraic subsetregular chainsemi-definite polynomial

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Real algebra (13J30) Computational aspects and applications of commutative rings (13P99)

Recommendations

• An effective decision method for semidefinite polynomials
• scientific article; zbMATH DE number 1490029
• An algorithm for sums of squares of a class of positive semi-definite polynomials
• Semidefinite programming and sums of Hermitian squares of noncommutative polynomials

Cites work

• scientific article; zbMATH DE number 1601215 (Why is no real title available?)
• scientific article; zbMATH DE number 3887879 (Why is no real title available?)
• scientific article; zbMATH DE number 3897078 (Why is no real title available?)
• scientific article; zbMATH DE number 3970886 (Why is no real title available?)
• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 3689524 (Why is no real title available?)
• scientific article; zbMATH DE number 517393 (Why is no real title available?)
• scientific article; zbMATH DE number 1490029 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
• Algorithms in real algebraic geometry
• An effective decision method for semidefinite polynomials
• Associative differential operations
• General procedure for multivariable polynomial positivity test with control applications
• Inner algorithm to test for positive definiteness of arbitrary binary forms
• Lectures on formally real fields
• On the extension of real places
• On the theories of triangular sets

Cited in

(4)

• Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method
• An effective decision method for semidefinite polynomials
• scientific article; zbMATH DE number 6310635 (Why is no real title available?)
• An algorithm for semi-infinite polynomial optimization

This page was built for publication: An improved algorithm for deciding semi-definite polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404554)