Generalized Peaceman-Rachford splitting method with substitution for convex programming
From MaRDI portal
Publication:2228367
DOI10.1007/s11590-019-01473-2zbMath1459.90150OpenAlexW2970490114MaRDI QIDQ2228367
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01473-2
global convergencevariational inequalityconvex programmingalternating direction method of multiplierssubstitution
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization ⋮ Accelerated stochastic Peaceman-Rachford method for empirical risk minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Generalized peaceman-Rachford splitting method for separable convex programming with applications to image processing
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
- 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
- Convergent prediction-correction-based ADMM for multi-block separable convex programming
- Generalized symmetric ADMM for separable convex optimization
- Relaxed inertial proximal Peaceman-Rachford splitting method for separable convex programming
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- The symmetric ADMM with indefinite proximal regularization and its application
- Multiplier and gradient methods
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Regression Shrinkage and Selection via The Lasso: A Retrospective
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An inertial proximal Peaceman-Rachford splitting method
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Signal Recovery by Proximal Forward-Backward Splitting
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Generalized Peaceman-Rachford splitting method with substitution for convex programming
