On polyhedral and second-order cone decompositions of semidefinite optimization problems
Name
1910.03143.pdf
Description
Accepted version
Size
480.12 KB
Format
Adobe PDF
Checksum (MD5)
feba2426bc903ff21b7a2c1fd47c7b3c
Author(s)
Bertsimas, Dimitris J
Cory-Wright, Ryan
Date Issued
January 2020
Journal
Operations Research Letters
Publisher
Elsevier BV
Citation
Bertsimas, Dimitris and Ryan Cory-Wright. "On polyhedral and second-order cone decompositions of semidefinite optimization problems." Operations Research Letters 48, 1 (January 2020): 78-85
Version
Author's final manuscript
Abstract
We study a cutting-plane method for semidefinite optimization problems, 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 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% for sparse PCA problems with 1000s of covariates, and solve nuclear norm problems over 500 × 500 matrices.
MIT Department
Sloan School of Management
Massachusetts Institute of Technology. Operations Research Center
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.orl.2019.12.003
