Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
From MaRDI portal
Publication:5043282
DOI10.1137/21M1422574zbMath1504.90091arXiv2105.11369OpenAlexW3164934243MaRDI QIDQ5043282
Publication date: 21 October 2022
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.11369
Convex programming (90C25) Numerical methods involving duality (49M29) Interior-point methods (90C51) Polynomial optimization (90C23) Computational real algebraic geometry (14Q30)
Related Items (1)
Uses Software
Cites Work
- Efficient and accurate computation of upper bounds of approximation errors
- Rational certificates of positivity on compact semialgebraic sets
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Sums of squares of polynomials with rational coefficients
- Signomial and polynomial optimization via relative entropy and partial dualization
- The algebraic degree of semidefinite programming
- Certificates of positivity in the Bernstein basis
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Sparsity in sums of squares of polynomials
- Conic programming: infeasibility certificates and projective geometry
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Formalization of Bernstein polynomials and applications to global optimization
- Computing sum of squares decompositions with rational coefficients
- SONC optimization and exact nonnegativity certificates via second-order cone programming
- Global Optimization with Polynomials and the Problem of Moments
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Computing rational solutions of linear matrix inequalities
- Validating the Completeness of the Real Solution Set of a System of Polynomial Equations
- Sum-of-Squares Optimization without Semidefinite Programming
- R <scp>eal</scp> c <scp>ertify</scp>
- Exact Semidefinite Programming Bounds for Packing Problems
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- On Exact Polya and Putinar's Representations
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- GloptiPoly
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets
