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
On methods to determine bounds on the Q-factor for a given directivity
TL;DR: In this article, the authors derive lower bounds on the Q-factor for a total desired directivity for an arbitrarily shaped antenna in a given direction as a convex problem using semi-definite relaxation techniques.
Posted Content
Solving natural conic formulations with Hypatia.jl.
TL;DR: Hypatia as discussed by the authors is an open-source conic primal-dual interior point solver with a generic interface for exotic cones, which can use a much broader class of exotic cones.
Journal ArticleDOI
Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
TL;DR: In this paper, the authors study the problem of synthesizing a policy that maximizes the entropy of a Markov decision process (MDP) subject to a temporal logic constraint, and present an algorithm which is based on a convex optimization problem to synthesize a policy.
Journal ArticleDOI
GMRES-Accelerated ADMM for Quadratic Objectives
Richard Zhang,Jacob K. White +1 more
TL;DR: In this article, the alternating direction method of multipliers (ADMM) is applied to solve saddle-point problems with strongly convex quadratic objectives, where the update equations are linear, the iterates are confined within a Krylov subspace, and the GMRES algorithm is optimal in its ability to accelerate convergence.
Posted Content
Engineering and Business Applications of Sum of Squares Polynomials
TL;DR: The current challenge that scalability represents for optimization problems that involve sum of squares polynomials is addressed, and some directions that could be pursued to further disseminate sum of square techniques within more applied fields are highlighted.
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.