Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
From MaRDI portal
Publication:654030
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
Cites work
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Computing sum of squares decompositions with rational coefficients
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On sums of squares
- On the absence of uniform denominators in Hilbert’s 17th problem
- On the complexity of Putinar's Positivstellensatz
- Polynomials in \(\mathbb{R}[x,y]\) that are sums of squares in \(\mathbb{R}(x,y)\)
- Positive polynomials in control.
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Real Algebraic Geometry and Ordered Structures
- Real solving for positive dimensional systems.
- Semidefinite Programming
- Sums of squares over totally real fields are rational sums of squares
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- The Voronoi diagram of three lines
- The ratio between the Toeplitz and the unstructured condition number
- Uniform denominators in Hilbert's seventeenth problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(33)- A heuristic method for certifying isolated zeros of polynomial systems
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- Certification of real inequalities: templates and sums of squares
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- Complexity, exactness, and rationality in polynomial optimization
- LMI stability conditions for uncertain rational nonlinear systems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Verification protocols with sub-linear communication for polynomial matrix operations
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- An algorithm for decomposing a non-negative polynomial as a sum of squares of rational functions
- On exact Reznick, Hilbert-Artin and Putinar's representations
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Automating algorithm selection: checking for matrix properties that can simplify computations
- Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
- Exact asymptotic stability analysis and region-of-attraction estimation for nonlinear systems
- Exact Semidefinite Programming Bounds for Packing Problems
- Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
- Exact safety verification of hybrid systems using sums-of-squares representation
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
- Validating numerical semidefinite programming solvers for polynomial invariants
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Computing the determinant of a matrix with polynomial entries by approximation
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system
- scientific article; zbMATH DE number 7559240 (Why is no real title available?)
- Computing sparse Fourier sum of squares on finite abelian groups in quasi-linear time
- {\textsc{RealCertify}}: a Maple package for certifying non-negativity
- Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
- Exact certification in global polynomial optimization via rationalizing sums-of-squares
- Sums of squares of polynomials with rational coefficients
- Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size
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)
