DeepAI AI Chat
Log In Sign Up

On Polyhedral and Second-Order-Cone Decompositions of Semidefinite Optimization Problems

by   Dimitris Bertsimas, et al.

We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's diameter, we argue that the method performs well when initialized with a second-order-cone approximation, instead of a linear approximation. We invoke the method to provide bound gaps of 0.5-6.5 sparse PCA problems with 1000s of covariates, and solve nuclear norm problems over 500x500 matrices.


page 1

page 2

page 3

page 4


Polynomial Optimization: Enhancing RLT relaxations with Conic Constraints

Conic optimization has recently emerged as a powerful tool for designing...

Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices

Finding the r× r submatrix of maximum volume of a matrix A∈ℝ^n× n is an ...

A unified approach to mixed-integer optimization: Nonlinear formulations and scalable algorithms

We propose a unified framework to address a family of classical mixed-in...

A Unifying Framework for Convergence Analysis of Approximate Newton Methods

Many machine learning models are reformulated as optimization problems. ...

Improving Optimal Power Flow Relaxations Using 3-Cycle Second-Order Cone Constraints

This paper develops a novel second order cone relaxation of the semidefi...

A Faster Interior Point Method for Semidefinite Programming

Semidefinite programs (SDPs) are a fundamental class of optimization pro...

Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference

We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inf...