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
Sag-Free Initialization for Strand-Based Hybrid Hair Simulation
TL;DR: In this article , a four-stage sag-free initialization framework is proposed to solve stable quasistatic configurations for hybrid strand-based hair dy-∗∗sag and deform into unintended and undesirable shapes.
Journal ArticleDOI
On estimation of the optimal parameter of the modulus‐based matrix splitting algorithm for linear complementarity problems on second‐order cones
Zhizhi Li,Huai Zheng +1 more
TL;DR: In this paper , the optimal parameter of each step of the MMS algorithm for solving linear complementarity problems on the direct product of second-order cones (SOCLCPs) is presented.
Proceedings ArticleDOI
Network Aware Forecasting for eCommerce Supply Planning
TL;DR: This paper is primarily interested in supply chain aware forecasting methods that does not impose any restrictions on demand forecasting process and proposes a general gradient descent based approach that works across different distributions from exponential family.
Journal ArticleDOI
Two-tiered Online Optimization of Region-wide Datacenter Resource Allocation via Deep Reinforcement Learning
Chang-Lin Chen,Hanhan Zhou,Jiaoyan Chen,M Pedramfar,Vaneet Aggarwal,Tian Lan,Zheqing Zhu,Chi Zhou,Timothy M. Gasser,Pol Mauri Ruiz,Vijay Krishna Menon,Neeraj Kumar,Hong Yu Dong +12 more
TL;DR: In this paper , a two-level Deep Reinforcement Learning (DRL)-based algorithm is introduced to solve optimal server-to-reservation assignment, taking into account of fault tolerance, server movement minimization, and network affinity requirements due to the impracticality of directly applying DRL algorithms to large scale instances with millions of decision variables.
Massively parallel hybrid quantum-classical machine learning for kernelized time-series classification
TL;DR: In this paper , a hybrid quantum-classical machine learning approach is proposed to deduce pairwise temporal relationships between time-series instances using a time-Series Hamiltonian kernel (TSHK).
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.