Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
From MaRDI portal
Publication:654030
DOI10.1016/j.jsc.2011.08.002zbMath1229.90115OpenAlexW2016389104WikidataQ57433996 ScholiaQ57433996MaRDI QIDQ654030
Lihong Zhi, Bin Li, Zhengfeng Yang, Erich L. Kaltofen
Publication date: 21 December 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.002
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (27)
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ Computing the determinant of a matrix with polynomial entries by approximation ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ LMI stability conditions for uncertain rational nonlinear systems ⋮ Exact asymptotic stability analysis and region-of-attraction estimation for nonlinear systems ⋮ Generating exact nonlinear ranking functions by symbolic-numeric hybrid method ⋮ Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods ⋮ Exact safety verification of hybrid systems using sums-of-squares representation ⋮ Automating algorithm selection: checking for matrix properties that can simplify computations ⋮ Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials ⋮ Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system ⋮ An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ Unnamed Item ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ Sums of squares of polynomials with rational coefficients ⋮ On isolation of simple multiple zeros and clusters of zeros of polynomial systems ⋮ On the Generation of Positivstellensatz Witnesses in Degenerate Cases ⋮ Exact Semidefinite Programming Bounds for Packing Problems ⋮ Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization ⋮ Certification of real inequalities: templates and sums of squares ⋮ An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of Putinar's Positivstellensatz
- Positive polynomials in control.
- Real solving for positive dimensional systems.
- Uniform denominators in Hilbert's seventeenth problem
- Computing sum of squares decompositions with rational coefficients
- Polynomials in $\mathbb {R}[x,y$ that are sums of squares in $\mathbb {R}(x,y)$]
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Sums of squares over totally real fields are rational sums of squares
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Real Algebraic Geometry and Ordered Structures
- On the absence of uniform denominators in Hilbert’s 17th problem
- On sums of squares
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
