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
Optimization With Affine Homogeneous Quadratic Integral Inequality Constraints
TL;DR: QUINOPT, an open-source add-on to YALMIP to aid the formulation and solution of the SDPs, is presented, and the techniques on problems arising from the stability analysis of PDEs are demonstrated.
Posted Content
Bayesian experimental design using regularized determinantal point processes
TL;DR: A new fundamental connection between Bayesian experimental design and determinantal point processes is demonstrated, which is used to develop new efficient algorithms for finding optimal designs under four optimality criteria: A, C, D and V.
Journal ArticleDOI
Heuristic Methods and Performance Bounds for Photonic Design
TL;DR: The photonic design problem is set up and existing approaches for calculating performance bounds are unify, while also providing some natural generalizations and properties.
Posted Content
Stochastic Matrix-Free Equilibration
Steven Diamond,Stephen Boyd +1 more
TL;DR: A novel method for approximately equilibrating a matrix using only multiplication by the matrix and its transpose is presented, based on convex optimization and projected stochastic gradient descent, using an unbiased estimate of a gradient obtained by a randomized method.
Fundamental Bounds on Performance of Periodic Electromagnetic Radiators and Scatterers
TL;DR: The main focus is on the development and application of methods to obtain optimal bandwidth performance of periodic electromagnetic radiators and scatterers.
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.