On the optimal proximal parameter of an ADMM-like splitting method for separable convex programming
From MaRDI portal
Publication:2073353
DOI10.1007/978-981-16-2701-9_8OpenAlexW3203984361MaRDI QIDQ2073353
Publication date: 1 February 2022
Full work available at URL: https://doi.org/10.1007/978-981-16-2701-9_8
Computing methodologies for image processing (68U10) Biomedical imaging and signal processing (92C55) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
- Optimally linearizing the alternating direction method of multipliers for convex programming
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- Multiplier and gradient methods
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
- Monotone Operators and the Proximal Point Algorithm
- Sparsity and Smoothness Via the Fused Lasso
- Proximal Decomposition Via Alternating Linearization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- A splitting method for separable convex programming
- A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
