SuperSCS: fast and accurate large-scale conic optimization

We present SuperSCS: a fast and accurate method for solving large-scale convex conic problems. SuperSCS combines the SuperMann algorithmic framework with the Douglas-Rachford splitting which is applied on the homogeneous self-dual embedding of conic optimization problems: a model for conic optimization problems which simultaneously encodes the optimality conditions and infeasibility/unboundedness certificates for the original problem. SuperMann allows the use of fast quasi-Newtonian directions such as a modified restarted Broyden-type direction and Anderson's acceleration.

[1]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[2]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[3]  Felix Abramovich,et al.  High-Dimensional Classification by Sparse Logistic Regression , 2017, IEEE Transactions on Information Theory.

[4]  Stephen P. Boyd,et al.  Applications of second-order cone programming , 1998 .

[5]  Stephen P. Boyd,et al.  Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding , 2013, Journal of Optimization Theory and Applications.

[6]  J. Hiriart-Urruty,et al.  Fundamentals of Convex Analysis , 2004 .

[7]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[8]  D. Cox.  The Regression Analysis of Binary Sequences , 2017 .

[9]  Yang Zheng,et al.  Fast ADMM for homogeneous self-dual embedding of sparse SDPs , 2016, 1611.01828.

[10]  Stephen P. Boyd,et al.  ECOS: An SOCP solver for embedded systems , 2013, 2013 European Control Conference (ECC).

[11]  Stephen P. Boyd,et al.  A Primer on Monotone Operator Methods , 2015 .

[12]  Panagiotis Patrinos,et al.  SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators , 2016, IEEE Transactions on Automatic Control.

[13]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[14]  C. Mészáros,et al.  A repository of convex quadratic programming problems , 1999 .

[15]  Yousef Saad,et al.  Two classes of multisecant methods for nonlinear acceleration , 2009, Numer. Linear Algebra Appl..

[16]  Homer F. Walker,et al.  Anderson Acceleration for Fixed-Point Iterations , 2011, SIAM J. Numer. Anal..

[17]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[18]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[19]  Nicholas I. M. Gould,et al.  A Note on Performance Profiles for Benchmarking Software , 2016, ACM Trans. Math. Softw..

[20]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

[21]  Pantelis Sopasakis,et al.  Accelerated reconstruction of a compressively sampled data stream , 2016, 2016 24th European Signal Processing Conference (EUSIPCO).

[22]  Michael I. Jordan,et al.  A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, NIPS 2004.

[23]  Stephen P. Boyd,et al.  CVXPY: A Python-Embedded Modeling Language for Convex Optimization , 2016, J. Mach. Learn. Res..