On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems

DOI10.1007/s13675-015-0048-5zbMath1338.90306OpenAlexW2149119057MaRDI QIDQ285921

Ron Shefi, Marc Teboulle

Publication date: 19 May 2016

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13675-015-0048-5

zbMATH Keywords

alternating proximal methodscoordinate descentnon-asymptotic rate of convergencenon-smooth convex minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27)

Related Items

Fast Nonoverlapping Block Jacobi Method for the Dual Rudin--Osher--Fatemi Model, Accelerated alternating descent methods for Dykstra-like problems, Foundations of Gauge and Perspective Duality, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Proximal alternating penalty algorithms for nonsmooth constrained convex optimization, A partially proximal linearized alternating minimization method for finding Dantzig selectors, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, Low patch-rank image decomposition using alternating minimization algorithms, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Coordinate descent algorithms
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Convex Optimization in Signal Processing and Communications
• A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
• On the Convergence of Block Coordinate Descent Type Methods
• Proximité et dualité dans un espace hilbertien
• On search directions for minimization algorithms
• Convergence of a block coordinate descent method for nondifferentiable minimization