A new approximation hierarchy for polynomial conic optimization
From MaRDI portal
linear programmingsemi-definite programmingapproximation hierarchypolynomial conic optimizationpolynomial second-order cone programmingpolynomial semi-definite programming
Linear programming (90C05) Nonlinear programming (90C30) Semidefinite programming (90C22) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Semialgebraic sets and related spaces (14P10) Sums of squares and representations by other particular quadratic forms (11E25)
Recommendations
- scientific article; zbMATH DE number 617915
- Polyhedral approximations in p-order cone programming
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- A unifying polyhedral approximation framework for convex optimization
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- Exact conic programming relaxations for a class of convex polynomial cone programs
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- The Polya algorithm for convex approximation
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- A Lagrangian relaxation view of linear and semidefinite hierarchies
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Sum-of-Squares Approach to Fixed-Order H∞-Synthesis
- A bounded degree SOS hierarchy for polynomial optimization
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- An exact Jacobian SDP relaxation for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Cones, matrices and mathematical programming
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Minimizing polynomials via sum of squares over the gradient ideal
- Moments, positive polynomials and their applications
- On an extension of Pólya's Positivstellensatz
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomials on Compact Semialgebraic Sets
- Optimization of polynomials in non-commuting variables
- P-Complete Approximation Problems
- Polynomial optimization with real varieties
- Positive polynomials in control.
- Positive polynomials on semi-algebraic sets
- Pure states, positive matrix polynomials and sums of Hermitian squares
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Semidefinite programming and integer programming
- Semidefinite representations for finite varieties
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Some NP-complete problems in quadratic and nonlinear programming
- Some applications of polynomial optimization in operations research and real-time decision making
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of squares, moment matrices and optimization over polynomials
- The K-moment problem for compact semi-algebraic sets
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(10)- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- An efficient, strongly polynomial, -approximation parametric optimization scheme
- Homogenization for polynomial optimization with unbounded sets
- Alternative SDP and SOCP approximations for polynomial optimization
- Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
- New dependencies of hierarchies in polynomial optimization
- A hierarchy of spectral relaxations for polynomial optimization
- A bounded degree SOS hierarchy for polynomial optimization
Describes a project that uses
Uses Software
This page was built for publication: A new approximation hierarchy for polynomial conic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419540)
