A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
From MaRDI portal
Publication:5031806
DOI10.1080/00207160.2018.1435864zbMath1499.90163OpenAlexW2792560292MaRDI QIDQ5031806
Zhongming Wu, Foxiang Liu, Min Li
Publication date: 16 February 2022
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2018.1435864
global convergenceconvex programmingseparable structurePeaceman-Rachford splitting methodmulti-block
Related Items (7)
Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- A Low Patch-Rank Interpretation of Texture
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- 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 Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A splitting method for separable convex programming
- A proximal partially parallel splitting method for separable convex programs
- Application of the Strictly Contractive Peaceman-Rachford Splitting Method to Multi-Block Separable Convex Programming
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
This page was built for publication: A proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problems
