Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs

DOI10.1007/s10589-018-0037-8zbMath1411.90215arXiv1705.06391OpenAlexW3103034604MaRDI QIDQ1734768

Yang-yang Xu

Publication date: 27 March 2019

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.06391

zbMATH Keywords

primal-dual methodasynchronous parallelblock coordinate update

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27)

Related Items (1)

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming

Uses Software

• PDCO
• Yall1
• ARock
• HOGWILD

Cites Work

• Unnamed Item
• Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem
• Iteration complexity analysis of block coordinate descent methods
• A three-operator splitting scheme and its optimization applications
• On the sublinear convergence rate of multi-block ADMM
• A coordinate gradient descent method for nonsmooth separable minimization
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• 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 note on the alternating direction method of multipliers
• Randomized primal-dual proximal block coordinate updates
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Chaotic relaxation
• Atomic Decomposition by Basis Pursuit
• ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• 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
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
• A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
• Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising
• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
• On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
• Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming
• Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
• Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• On the Global Linear Convergence of the ADMM with MultiBlock Variables
• Convergence of a block coordinate descent method for nondifferentiable minimization
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

This page was built for publication: Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs