Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
Reads0
Chats0
TLDR
In this article, the alternating directions method of multipliers is used 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.Abstract:
We introduce a first-order method for solving very large convex cone programs. 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 requiring more time to reach very high accuracy. Compared to other first-order methods for cone programs, our approach finds both primal and dual solutions when available or a certificate of infeasibility or unboundedness otherwise, is parameter free, and the per-iteration cost of the method is the same as applying a 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, 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 problems, and scaling to very large general cone programs.read more
Citations
More filters
Journal ArticleDOI
SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators
TL;DR: SuperMann as mentioned in this paper is a Newton-type algorithm for finding fixed points of nonexpansive operators, which generalizes the classical Krasnosel'skii-Mann scheme and enjoys favorable global convergence properties and requires exactly the same oracle.
Journal ArticleDOI
QAOA-in-QAOA: Solving Large-Scale MaxCut Problems on Small Quantum Machines
TL;DR: It is proved that the merging process in MaxCut can be further cast into a new MaxCut problem and thus be addressed by QAOAs or other MaxCut solvers, and it is proven that the approximation ratio of QAOA 2 is lower bounded by 1 / 2.
Proceedings ArticleDOI
Fast ADMM for Semidefinite Programs with Chordal Sparsity
TL;DR: This paper develops efficient first-order methods to solve SDPs with chordal sparsity based on the alternating direction method of multipliers (ADMM), and shows that chordal decomposition can be applied to either the primal or the dual standard form of a sparse SDP.
Proceedings ArticleDOI
Stochastic optimal control using semidefinite programming for moment dynamics
TL;DR: A procedure to increase the size of the semidefinite program, leading to increasingly accurate approximations to the true optimal control strategy, is given.
Journal ArticleDOI
Optimal transport over nonlinear systems via infinitesimal generators on graphs
TL;DR: This work connects set-oriented operator-theoretic methods in dynamical systems with optimal mass transportation theory, and opens up new directions in design of efficient feedback control strategies for nonlinear multi-agent and swarm systems operating in nonlinear ambient flow fields.
References
More filters
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Book
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers
TL;DR: It is argued that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas.