SCS
SCS: Splitting conic solver: Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding. We introduce a first order method for solving very large cone programs to modest accuracy. The method uses an operator splitting method, the alternating directions method of multipliers, to solve the homogeneous self-dual embedding, an equivalent feasibility problem involving finding a nonzero point in the intersection of a subspace and a cone. This approach has several favorable properties. Compared to interior-point methods, first-order methods scale to very large problems, at the cost of lower accuracy. Compared to other first-order methods for cone programs, our approach finds both primal and dual solutions when available and certificates of infeasibility or unboundedness otherwise, it does not rely on any explicit algorithm parameters, and the per-iteration cost of the method is the same as applying the splitting method to the primal or dual alone. We discuss efficient implementation of the method in detail, including direct and indirect methods for computing projection onto the subspace, scaling the original problem data, and stopping criteria. We describe an open-source implementation called SCS, which handles the usual (symmetric) nonnegative, second-order, and semidefinite cones as well as the (non-self-dual) exponential and power cones and their duals. We report numerical results that show speedups over interior-point cone solvers for large SOCPs, and scaling to very large general cone programs.
Keywords for this software
References in zbMATH (referenced in 27 articles )
Showing results 1 to 20 of 27.
Sorted by year (- Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
- Eltved, Anders; Dahl, Joachim; Andersen, Martin S.: On the robustness and scalability of semidefinite relaxation for optimal power flow problems (2020)
- Hütter, Jan-Christian; Mao, Cheng; Rigollet, Philippe; Robeva, Elina: Optimal rates for estimation of two-dimensional totally positive distributions (2020)
- Liberti, Leo: Distance geometry and data science (2020)
- Li, Yongfeng; Liu, Haoyang; Wen, Zaiwen; Yuan, Ya-xiang: Low-rank matrix iteration using polynomial-filtered subspace extraction (2020)
- Milz, Johannes; Ulbrich, Michael: An approximation scheme for distributionally robust nonlinear optimization (2020)
- Zheng, Yang; Fantuzzi, Giovanni; Papachristodoulou, Antonis; Goulart, Paul; Wynn, Andrew: Chordal decomposition in operator-splitting methods for sparse semidefinite programs (2020)
- Banjac, Goran; Goulart, Paul; Stellato, Bartolomeo; Boyd, Stephen: Infeasibility detection in the alternating direction method of multipliers for convex optimization (2019)
- Busseti, Enzo; Moursi, Walaa M.; Boyd, Stephen: Solution refinement at regular points of conic problems (2019)
- Fu, Anqi; Ungun, Barıṣ; Xing, Lei; Boyd, Stephen: A convex optimization approach to radiation treatment planning with dose constraints (2019)
- Goluskin, David; Fantuzzi, Giovanni: Bounds on mean energy in the Kuramoto-Sivashinsky equation computed using semidefinite programming (2019)
- Kaluba, Marek; Nowak, Piotr W.; Ozawa, Narutaka: (\Aut(\mathbbF_5)) has property ((T)) (2019)
- Khamaru, Koulik; Mazumder, Rahul: Computation of the maximum likelihood estimator in low-rank factor analysis (2019)
- Necoara, I.; Nesterov, Yu.; Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization (2019)
- Adam Rahman: sdpt3r: Semidefinite Quadratic Linear Programming in R (2018) not zbMATH
- Combettes, Patrick L.; Müller, Christian L.: Perspective functions: proximal calculus and applications in high-dimensional statistics (2018)
- Elamvazhuthi, Karthik; Grover, Piyush: Optimal transport over nonlinear systems via infinitesimal generators on graphs (2018)
- Fantuzzi, Giovanni; Pershin, Anton; Wynn, Andrew: Bounds on heat transfer for Bénard-Marangoni convection at infinite Prandtl number (2018)
- Kaluba, Marek; Nowak, Piotr W.: Certifying numerical estimates of spectral gaps (2018)
- Tepper, Mariano; Sengupta, Anirvan M.; Chklovskii, Dmitri: Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling (2018)