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
Proceedings ArticleDOI
DC Programming and DCA for Power Minimization Problem in Multi-User Beamforming Networks
TL;DR: The main purpose of this paper is to design beamforming coefficients to minimize the total relay transmitted power under destination Quality-of-Service (QoS) constraints.
Journal ArticleDOI
Hierarchy of quantum operations in manipulating coherence and entanglement
TL;DR: In this article, the authors establish hierarchies of different operations for manipulating coherence and entanglement in distributed settings, where at least one of the two spatially separated parties are restricted from generating coherence.
Journal ArticleDOI
Adaptive Position Estimation for Vehicles using Range Measurements
Sai Krishna Kanth Hari,Kaarthik Sundar,José Braga,João Paulo Teixeira,Swaroop Darbha,João Borges de Sousa +5 more
TL;DR: This article addresses the problem of estimating the position of the center of mass of a vehicle from range measurements that are available to the vehicle via communication of its on-board receiver to multiple beacons through a convex optimization problem.
New Developments of ADMM-based Interior Point Methods for Linear Programming and Conic Programming
Qi Deng,Qing Feng,Wenzhi Gao,Dongdong Ge,Bo Jiang,Yuntian Jiang,Jingsong Liu,Tianhao Liu,Chenyu Xue,Yinyu Ye,Chuwen Zhang +10 more
TL;DR: The enhanced ABIP achieves a 5.8x reduction in the geometric mean of run time on 105 LP instances from Netlib and it compares favorably against state-of theart open-source solvers in a wide range of large-scale problems.
Journal ArticleDOI
Scatterer Identification by Atomic Norm Minimization in Vehicular mm-Wave Propagation Channels
Herbert Groll,Peter Gerstoft,Markus Hofer,Jiri Blumenstein,Thomas Zemen,Christoph F. Mecklenbrauker +5 more
TL;DR: Sparse scatterer identification with atomic norm minimization techniques in the delay-Doppler domain is investigated for a vehicle-to-infrastructure millimeter wave propagation channel andSimulations show that spatial clusters of a point-scatterers with small cluster spread are suitable to model specular reflection which result in significant MPCs and the successful extraction of their delay- doppler parameters.
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.