An effective decision method for semidefinite polynomials

DOI10.1016/S0747-7171(03)00073-7zbMath1057.13020MaRDI QIDQ1432891

Xiaoning Zeng, Guangxing Zeng

Publication date: 22 June 2004

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Maplecomputable ordered fieldsemidefiniteness of multivariate polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Computational aspects and applications of commutative rings (13P99) Polynomials over commutative rings (13B25) Real algebra (13J30)

Related Items (6)

Equality-constrained minimization of polynomial functions ⋮ An improved algorithm for deciding semi-definite polynomials ⋮ Algorithms for computing the global infimum and minimum of a polynomial function ⋮ Global minimization of multivariate polynomials using nonstandard methods ⋮ Determination of the limits for multivariate rational functions ⋮ Semi-algebraically connected components of minimum points of a polynomial function

Uses Software

• Maple

Cites Work

• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• On the extension of real places
• A new decision method for elementary algebra
• Inner algorithm to test for positive definiteness of arbitrary binary forms
• General procedure for multivariable polynomial positivity test with control applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An effective decision method for semidefinite polynomials