Optimization over structured subsets of positive semidefinite matrices via column generation
From MaRDI portal
Publication:1751222
DOI10.1016/j.disopt.2016.04.004zbMath1387.90179arXiv1512.05402OpenAlexW2963566960MaRDI QIDQ1751222
Sanjeeb Dash, Georgina Hall, Amir Ali Ahmadi
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05402
linear programmingsemidefinite programmingcopositive programmingpolynomial optimizationsecond order cone programming
Related Items (17)
Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ LP-based tractable subcones of the semidefinite plus nonnegative cone ⋮ Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ Evaluating approximations of the semidefinite cone with trace normalized distance ⋮ A Sum of Squares Characterization of Perfect Graphs ⋮ 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 ⋮ Tighter bounds on transient moments of stochastic chemical systems ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Sum of squares basis pursuit with linear and second order cone programming ⋮ Bounding extrema over global attractors using polynomial optimisation ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods ⋮ Polyhedral approximations of the semidefinite cone and their application ⋮ Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices ⋮ Decomposed structured subsets for semidefinite and sum-of-squares optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some applications of polynomial optimization in operations research and real-time decision making
- Enhancing RLT relaxations via a new class of semidefinite cuts
- An effective branch-and-bound algorithm for convex quadratic integer programming
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Applications of second-order cone programming
- Extremal positive semidefinite forms
- Second-order cone programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Semidefinite programming relaxations for semialgebraic problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Cones of diagonally dominant matrices
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Global Optimization with Polynomials and the Problem of Moments
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- Copositive Programming
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Some NP-complete problems in quadratic and nonlinear programming
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- On Polyhedral Approximations of the Second-Order Cone
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
This page was built for publication: Optimization over structured subsets of positive semidefinite matrices via column generation
