Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
DOI10.1016/J.JSC.2011.08.002zbMATH Open1229.90115OpenAlexW2016389104WikidataQ57433996 ScholiaQ57433996MaRDI QIDQ654030FDOQ654030
Erich L. Kaltofen, Lihong Zhi, Bin Li, Zhengfeng Yang
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
Approximation methods and heuristics in mathematical programming (90C59) Semidefinite programming (90C22)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Semidefinite Programming
- Uniform denominators in Hilbert's seventeenth problem
- Title not available (Why is that?)
- On the absence of uniform denominators in Hilbert’s 17th problem
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On the complexity of Putinar's Positivstellensatz
- Positive polynomials in control.
- Computing sum of squares decompositions with rational coefficients
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Real solving for positive dimensional systems.
- Sums of squares over totally real fields are rational sums of squares
- Polynomials in \(\mathbb{R}[x,y]\) that are sums of squares in \(\mathbb{R}(x,y)\)
- Title not available (Why is that?)
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Title not available (Why is that?)
- Real Algebraic Geometry and Ordered Structures
- On sums of squares
Cited In (30)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- Title not available (Why is that?)
- Sums of squares of polynomials with rational coefficients
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Verification protocols with sub-linear communication for polynomial matrix operations
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- Complexity, exactness, and rationality in polynomial optimization
- Certification of real inequalities: templates and sums of squares
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- A heuristic method for certifying isolated zeros of polynomial systems
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Computing the determinant of a matrix with polynomial entries by approximation
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- LMI stability conditions for uncertain rational nonlinear systems
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
- Bounds for Deterministic and Stochastic Dynamical Systems using Sum-of-Squares Optimization
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
- Validating numerical semidefinite programming solvers for polynomial invariants
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares
- Exact asymptotic stability analysis and region-of-attraction estimation for nonlinear systems
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Exact Semidefinite Programming Bounds for Packing Problems
- Exact safety verification of hybrid systems using sums-of-squares representation
Uses Software
Recommendations
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars 👍 👎
- Exact certification in global polynomial optimization via rationalizing sums-of-squares 👍 👎
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients 👍 👎
- On Exact Polya and Putinar's Representations 👍 👎
- On exact Reznick, Hilbert-Artin and Putinar's representations 👍 👎
This page was built for publication: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q654030)