The symmetric ADMM with indefinite proximal regularization and its application
From MaRDI portal
Publication:2364718
DOI10.1186/s13660-017-1447-3zbMath1368.90128OpenAlexW2738296017WikidataQ41095225 ScholiaQ41095225MaRDI QIDQ2364718
Min Sun, Maoying Tian, Hongchun Sun
Publication date: 24 July 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1447-3
global convergencesymmetric alternating direction method of multipliersindefinite proximal regularization
Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items
Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming, An accelerated proximal augmented Lagrangian method and its application in compressive sensing, Generalized Peaceman-Rachford splitting method with substitution for convex programming, Convergence revisit on generalized symmetric ADMM, Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization, An indefinite proximal Peaceman-Rachford splitting method with substitution procedure for convex programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- A class of linearized proximal alternating direction methods
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- On Glowinski's open question on the alternating direction method of multipliers
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- A proximal Peaceman-Rachford splitting method for compressive sensing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Robust principal component analysis?
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- A proximal splitting method for separable convex programming and its application to compressive sensing
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Proximal Decomposition Via Alternating Linearization
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
