Convergence of the augmented decomposition algorithm

DOI10.1007/s10589-018-0039-6zbMath1418.90198arXiv1808.08287OpenAlexW2888477203MaRDI QIDQ1734773

Hongsheng Liu, Shu Lu

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/1808.08287

zbMATH Keywords

convergence ratedistributed computingseparable convex minimizationaugmented decomposition algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• An implementable proximal point algorithmic framework for nuclear norm minimization
• An augmented Lagrangian method for distributed optimization
• On the linear convergence of the alternating direction method of multipliers
• Optimal scaling of a gradient method for distributed resource allocation
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A diagonal quadratic approximation method for large scale linear programs
• A proximal-based deomposition method for compositions method for convex minimization problems
• A new inexact alternating directions method for monotone variational inequalities
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• A note on the alternating direction method of multipliers
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Alternating proximal gradient method for convex minimization
• Accelerated Block-coordinate Relaxation for Regularized Optimization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
• Asymptotic Convergence Analysis of the Proximal Point Algorithm
• Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
• Implicit Functions and Solution Mappings
• Applications of the method of partial inverses to convex programming: Decomposition
• Some continuity properties of polyhedral multifunctions
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• New Proximal Point Algorithms for Convex Minimization
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
• A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Network Topology and Communication Data Rate for Consensusability of Discrete-Time Multi-Agent Systems
• An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: Convergence of the augmented decomposition algorithm