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
Continuous-time finite-horizon ADP for automated vehicle controller design with high efficiency
TL;DR: A continuous-time (CT) finite-horizon approximate dynamic programming (ADP) method, which can synthesis off-line near optimal control policy with analytical vehicle dynamics and applies to the automated vehicle trajectory tracking control in both linear and nonlinear cases.
Journal ArticleDOI
Quantifying & Modeling Feature Interactions: An Information Decomposition Framework
Paul Pu Liang,Yun Cheng,Xiang Fan,Chun Kai Ling,Suzanne Nie,Richard Chen,Zihao Deng,Faisal Mahmood,Ruslan Salakhutdinov,Louis-Philippe Morency +9 more
TL;DR: This paper proposed an information-theoretic approach to quantify the degree of redundancy, uniqueness, and synergy across input features, which they termed the PID statistics of a multimodal distribution.
Journal ArticleDOI
Query log compression for workload analytics
TL;DR: LogR as mentioned in this paper is a lossy log compression scheme suitable for use in many automated log analytics tools, as well as for human inspection, which can be found in the context of a broader family of pattern and pattern mixture log encodings.
Journal ArticleDOI
Ab-initio Contrast Estimation and Denoising of Cryo-EM Images
Yunpeng “Felix” Shi,Amit Singer +1 more
TL;DR: In this article , Li et al. proposed an effective method for contrast estimation directly from noisy images without using any 3D volume information, and demonstrated a modification of CWF to estimate the contrast of individual images.
Posted Content
SyDeBO: Symbolic-Decision-Embedded Bilevel Optimization for Long-Horizon Manipulation in Dynamic Environments.
TL;DR: This approach generates highly dynamic manipulation motions by incorporating the full robot and object dynamics and solves a holistically integrated bilevel optimization problem involving costs from both the low-level TO and the high-level search.
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.