A new approximation hierarchy for polynomial conic optimization
DOI10.1007/s10589-019-00066-0zbMath1414.90213OpenAlexW2911427463MaRDI QIDQ2419540
Peter J. C. Dickinson, Janez Povh
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://repozitorij.uni-lj.si/Dokument.php?id=116915&dn=
linear programmingsemi-definite programmingapproximation hierarchypolynomial conic optimizationpolynomial second-order cone programmingpolynomial semi-definite programming
Semidefinite programming (90C22) Nonlinear programming (90C30) Linear programming (90C05) Sums of squares and representations by other particular quadratic forms (11E25) Semialgebraic sets and related spaces (14P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of polynomial optimization in operations research and real-time decision making
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite representations for finite varieties
- The \(K\)-moment problem for compact semi-algebraic sets
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- Positive polynomials in control.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An exact Jacobian SDP relaxation for polynomial optimization
- On an extension of Pólya's Positivstellensatz
- A bounded degree SOS hierarchy for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Minimizing polynomials via sum of squares over the gradient ideal
- Cones, matrices and mathematical programming
- Global Optimization with Polynomials and the Problem of Moments
- Optimization of Polynomials in Non-Commuting Variables
- Polynomial Optimization with Real Varieties
- A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Pure states, positive matrix polynomials and sums of hermitian squares
- Some NP-complete problems in quadratic and nonlinear programming
- P-Complete Approximation Problems
- Positive polynomials on semi-algebraic sets
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- A Sum-of-Squares Approach to Fixed-Order H∞-Synthesis
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Optimization of Polynomials on Compact Semialgebraic Sets
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Copositive Programming Approach to Graph Partitioning
- GloptiPoly
- Constrained trace-optimization of polynomials in freely noncommuting variables
