A note on the convergence of alternating proximal gradient method
From MaRDI portal
Recommendations
- A note on the alternating direction method of multipliers
- scientific article; zbMATH DE number 6453672
- Alternating proximal gradient method for convex minimization
- A linearized alternating direction method of multipliers with substitution procedure
- An alternate minimization method beyond positive definite proximal regularization: convergence and complexity
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
Cited in
(8)- On the proximal gradient algorithm with alternated inertia
- Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- scientific article; zbMATH DE number 6453672 (Why is no real title available?)
- Alternating proximal gradient method for convex minimization
- A note on the alternating direction method of multipliers
- A proximal block minimization method of multipliers with a substitution procedure
- A proximal alternating direction method of multipliers with a substitution procedure
This page was built for publication: A note on the convergence of alternating proximal gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q529911)
