Sum of squares basis pursuit with linear and second order cone programming
From MaRDI portal
Publication:2979646
DOI10.1090/conm/685/13712zbMath1393.90081arXiv1510.01597OpenAlexW2272603263MaRDI QIDQ2979646
Amir Ali Ahmadi, Georgina Hall
Publication date: 25 April 2017
Published in: Algebraic and Geometric Methods in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.01597
maximum independent set problempartition problemdiagonally dominant sum of squaresprimal and dual perspectives
Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items (11)
Maximum feasible subsystems of distance geometry constraints ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Bounding extrema over global attractors using polynomial optimisation ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices ⋮ Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization ⋮ Decomposed structured subsets for semidefinite and sum-of-squares optimization ⋮ Diagonally Dominant Programming in Distance Geometry ⋮ Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the computational complexity of membership problems for the completely positive cone and its dual
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Applications of second-order cone programming
- Second-order cone programming
- Semidefinite programming relaxations for semialgebraic problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Positive polynomials in control.
- Cones of diagonally dominant matrices
- Uniform denominators in Hilbert's seventeenth problem
- An effective version of Pólya's theorem on positive definite forms
- Global Optimization with Polynomials and the Problem of Moments
- On the Shannon capacity of a graph
- Semidefinite Programming
- Reducibility among Combinatorial Problems
This page was built for publication: Sum of squares basis pursuit with linear and second order cone programming
