On polyhedral and second-order cone decompositions of semidefinite optimization problems
From MaRDI portal
Publication:2294533
DOI10.1016/J.ORL.2019.12.003OpenAlexW2979731212WikidataQ120700192 ScholiaQ120700192MaRDI QIDQ2294533FDOQ2294533
Authors: Ryan Cory-Wright, Dimitris Bertsimas 
Publication date: 11 February 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.03143
Recommendations
- A semidefinite relaxation method for second-order cone polynomial complementarity problems
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
- Semidefinite relaxations for mixed 0-1 second-order cone program
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- A note on treating a second order cone program as a special case of a semidefinite program
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
- On representing the positive semidefinite cone using the second-order cone
Cites Work
- JuMP: A Modeling Language for Mathematical Optimization
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Certifiably optimal sparse principal component analysis
- Title not available (Why is that?)
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Title not available (Why is that?)
- Solution of a Large-Scale Traveling-Salesman Problem
- An exact duality theory for semidefinite programming and its complexity implications
- The Cutting-Plane Method for Solving Convex Programs
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Bounds for eigenvalues using traces
- Approximation Limits of Linear Programs (Beyond Hierarchies)
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- A unifying framework for several cutting plane methods for semidefinite programming
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Strong SOCP Relaxations for the Optimal Power Flow Problem
Cited In (7)
- On Polyhedral and Second-Order Cone Decompositions of Semidefinite Optimization Problems
- Evaluating approximations of the semidefinite cone with trace normalized distance
- Title not available (Why is that?)
- The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability
- Tighter bounds on transient moments of stochastic chemical systems
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- A Scalable Algorithm for Sparse Portfolio Selection
Uses Software
This page was built for publication: On polyhedral and second-order cone decompositions of semidefinite optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294533)
