A note on the convergence of alternating proximal gradient method
From MaRDI portal
Publication:529911
DOI10.1016/j.amc.2013.11.101zbMath1364.90253OpenAlexW1981439380MaRDI QIDQ529911
Publication date: 9 June 2017
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.11.101
global convergencealternating direction method of multipliersstrongly convex functionsalternating proximal gradient method
Related Items
A proximal block minimization method of multipliers with a substitution procedure ⋮ Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit ⋮ Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem
Cites Work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A note on the alternating direction method of multipliers
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
