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
Posted Content
CVXPY: A Python-Embedded Modeling Language for Convex Optimization
Steven Diamond,Stephen Boyd +1 more
TL;DR: CVXPY allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers.
Journal Article
CVXPY: a python-embedded modeling language for convex optimization
Steven Diamond,Stephen Boyd +1 more
TL;DR: CVXPY as mentioned in this paper is a domain-specific language for convex optimization embedded in Python, which allows the user to express convex optimisation problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers.
Journal ArticleDOI
OSQP: An Operator Splitting Solver for Quadratic Programs
TL;DR: This work presents a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration.
Journal ArticleDOI
Fast online deconvolution of calcium imaging data.
TL;DR: The algorithm is a generalization of the pool adjacent violators algorithm (PAVA) for isotonic regression and inherits its linear-time computational complexity and gains remarkable increases in processing speed: more than one order of magnitude compared to currently employed state of the art convex solvers relying on interior point methods.
Journal ArticleDOI
A rewriting system for convex optimization problems
TL;DR: In this paper, a modular rewriting system for translating optimization problems written in a domain-specific language (DSL) to forms compatible with low-level solver interfaces is described.
References
More filters
Journal ArticleDOI
Differential properties of Euclidean projection onto power cone
TL;DR: Differential properties of Euclidean projection onto the high dimensional power cone, Projector’s formulas, its directional derivative formulas, and its first order Fréchet derivative formulas are considered.
The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
TL;DR: In this article, it was shown that the alternating direction method is in fact an instance of the proximal point algorithm applied to SAAB, and that Spingarn's technique for minimizing a convex function over a linear subspace is essentially a special case of the Lions-Mercier approach.
Journal ArticleDOI
Towards Nonsymmetric Conic Optimization
TL;DR: In this paper, a new interior-point method is proposed based on an extension of the ideas of self-scaled optimization to the general cases. But this method requires the primal correction process to find a scaling point, which can be used to compute a strictly feasible primal-dual pair by simple projection.
Proceedings ArticleDOI
Sequential and parallel projection algorithms for feasibility and optimization
TL;DR: The convex feasibility problem of finding a point in the intersection of finitely many closed convex sets in the Euclidean space has many applications in various fields of science and technology, particularly in problems of image reconstruction from projections, in solving the fully discretized inverse problem in radiation therapy treatment planning, and in other image processing problems as mentioned in this paper.