A proximal Peaceman-Rachford splitting method for solving the multi-block separable convex minimization problems
From MaRDI portal
Publication:5031806
DOI10.1080/00207160.2018.1435864zbMATH Open1499.90163OpenAlexW2792560292MaRDI QIDQ5031806FDOQ5031806
Authors: 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
Recommendations
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- Application of the strictly contractive Peaceman-Rachford splitting method to multi-block separable convex programming
- Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
global convergenceconvex programmingseparable structurePeaceman-Rachford splitting methodmulti-block
Cites Work
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- A splitting method for separable convex programming
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Convergence study on the symmetric version of ADMM with larger step sizes
- A proximal partially parallel splitting method for separable convex programs
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- A low patch-rank interpretation of texture
- A partial splitting augmented Lagrangian method for low patch-rank image decomposition
- Application of the strictly contractive Peaceman-Rachford splitting method to multi-block separable convex programming
Cited In (20)
- Application of the strictly contractive Peaceman-Rachford splitting method to multi-block separable convex programming
- An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
- Accelerated stochastic Peaceman-Rachford method for empirical risk minimization
- A linearized Peaceman-Rachford splitting method for structured convex optimization with application to stable principal component pursuit
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- Convergence study on strictly contractive peaceman-Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms
- Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming
- A proximal Peaceman-Rachford splitting method for compressive sensing
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
- An inexact symmetric ADMM algorithm with indefinite proximal term for sparse signal recovery and image restoration problems
- A partially proximal S-ADMM for separable convex optimization with linear constraints
- A modified strictly contractive peaceman-Rachford splitting method for multi-block separable convex programming
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
Uses Software
This page was built for publication: A proximal Peaceman-Rachford splitting method for solving the multi-block separable convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031806)
