Validating numerical semidefinite programming solvers for polynomial invariants
From MaRDI portal
Publication:5916266
DOI10.1007/s10703-017-0302-yzbMath1425.68081OpenAlexW2761297771MaRDI QIDQ5916266
Sriram Sankaranarayanan, Yuen-Lam Voronin, Pierre Roux
Publication date: 4 October 2018
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-017-0302-y
semidefinite programmingstatic analysisformal proofsfloating-point arithmeticpolynomial invariantsnumerical optimizationsum of squares relaxation
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (3)
Pegasus: sound continuous invariant generation ⋮ Verifying Switched System Stability With Logic ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Uses Software
Cites Work
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Solving semidefinite-quadratic-linear programs using SDPT3
- Facial reduction algorithms for conic optimization problems
- The Bernstein polynomial basis: a centennial retrospective
- Polyhedral and semidefinite programming methods in combinatorial optimization
- A facial reduction algorithm for finding sparse SOS representations
- Handbook on semidefinite, conic and polynomial optimization
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Quantifier elimination for real algebra -- the quadratic case and beyond
- The algebraic degree of semidefinite programming
- Representing polynomials by positive linear functions on compact convex polyhedra
- Regularizing the abstract convex program
- Partial cylindrical algebraic decomposition for quantifier elimination
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Semidefinite programming relaxations for the quadratic assignment problem
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite programming
- Abstract interpretation with higher-dimensional ellipsoids and conic extrapolation
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Semidefinite programming relaxations for the graph partitioning problem
- Formal proofs of rounding error bounds. With application to an automatic positive definiteness check
- Computing sum of squares decompositions with rational coefficients
- Constructing invariants for hybrid systems
- Verification of positive definiteness
- Global Optimization with Polynomials and the Problem of Moments
- Template-Based Unbounded Time Verification of Affine Hybrid Automata
- Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations
- Improving Strategies via SMT Solving
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Verifying Nonlinear Real Formulas Via Sums of Squares
- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
- Grammar Analysis and Parsing by Abstract Interpretation
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Robust Solutions to Uncertain Semidefinite Programs
- Strong Duality for Semidefinite Programming
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Error Bounds for Linear Matrix Inequalities
- Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis
- Semidefinite Programming
- dReal: An SMT Solver for Nonlinear Theories over the Reals
- Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- SMC
- Hybrid Systems: Computation and Control
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
- Static Analysis by Policy Iteration on Relational Domains
- Precise Fixpoint Computation Through Strategy Iteration
- Static Analysis
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Validating numerical semidefinite programming solvers for polynomial invariants
- Algorithms in real algebraic geometry
- Computational experience with ill-posed problems in semidefinite programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Validating numerical semidefinite programming solvers for polynomial invariants
