Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
From MaRDI portal
Publication:5301618
DOI10.1145/1390768.1390792zbMath1493.68402OpenAlexW1982216340MaRDI QIDQ5301618
Zhengfeng Yang, Erich L. Kaltofen, Bin Li, Lihong Zhi
Publication date: 20 January 2009
Published in: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1390768.1390792
Related Items (20)
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ 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 ⋮ Sharper and Simpler Nonlinear Interpolants for Program Verification ⋮ Approximate gcds of polynomials and sparse SOS relaxations ⋮ Duality of sum of nonnegative circuit polynomials and optimal SONC bounds ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods ⋮ Methodologies of Symbolic Computation ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ Smaller SDP for SOS decomposition ⋮ Exact Semidefinite Programming Bounds for Packing Problems ⋮ A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture ⋮ Variable projection methods for approximate (greatest) common divisor computations
Uses Software
This page was built for publication: Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
