Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
From MaRDI portal
Publication:1753069
DOI10.1007/s10589-017-9972-zzbMath1391.90483arXiv1702.05423OpenAlexW2590881306MaRDI QIDQ1753069
Publication date: 25 May 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.05423
primal-dual methodalternating direction method of multipliers (ADMM)block coordinate updateaccelerated first-order method
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Randomized algorithms (68W20)
Related Items
New method for solving Ivanov regularization-based support vector machine learning, Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming, An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization, Randomized primal-dual proximal block coordinate updates, A generic coordinate descent solver for non-smooth convex optimisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Parallel coordinate descent methods for big data optimization
- Gradient methods for minimizing composite functions
- On the complexity analysis of randomized block-coordinate descent methods
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Coordinate-friendly structures, algorithms and applications
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Support-vector networks
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Randomized primal-dual proximal block coordinate updates
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Atomic Decomposition by Basis Pursuit
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming
- Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
- Fast Alternating Direction Optimization Methods
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- An Accelerated Linearized Alternating Direction Method of Multipliers
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- On the Global Linear Convergence of the ADMM with MultiBlock Variables
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
