Pages that link to "Item:Q5301618"
From MaRDI portal
The following pages link to Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars (Q5301618):
Displaying 21 items.
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- A heuristic method for certifying isolated zeros of polynomial systems (Q1634514) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- On exact Reznick, Hilbert-Artin and Putinar's representations (Q2029015) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) (Q2399868) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares (Q3576578) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Sharper and Simpler Nonlinear Interpolants for Program Verification (Q5056007) (← links)
- A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture (Q5253730) (← links)
- Roundoff-Error-Free Basis Updates of LU Factorizations for the Efficient Validation of Optimality Certificates (Q5358295) (← links)
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients (Q5883314) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)
