Convergence analysis of split-Douglas-Rachford algorithm and a novel preconditioned ADMM with an improved condition
type: Item
instance of: scholarly article
title: Convergence analysis of split-Douglas-Rachford algorithm and a novel preconditioned ADMM with an improved condition
author: Maoran Wang
author: Xing-Ju Cai
author: Yongxin Chen
published in: Numerical Mathematics: Theory, Methods and Applications
publication date: 2025-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 7966442
zbMATH Keywords: primal-dual monotone inclusion problem
zbMATH Keywords: split-Douglas-Rachford algorithm
zbMATH Keywords: preconditioned ADMM
zbMATH Keywords: improved convergence condition
zbMATH Keywords: sublinear convergence rate
MaRDI profile type: Publication
cites work: Discrete Cosine Transform
cites work: Q5690237
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
cites work: Split-Douglas--Rachford Algorithm for Composite Monotone Inclusions and Split-ADMM
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
cites work: \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers
cites work: An improved first-order primal-dual algorithm with a new correction step
cites work: An algorithm for total variation minimization and applications
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: An introduction to continuous optimization for imaging
cites work: Atomic decomposition by basis pursuit
cites work: Variable metric forward–backward splitting with applications to monotone inclusions in duality
cites work: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
cites work: Q3125701
cites work: First-Order Methods for Sparse Covariance Selection
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Q5689624
cites work: Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
cites work: A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems
cites work: Optimally linearizing the alternating direction method of multipliers for convex programming
cites work: On the Convergence of Primal-Dual Hybrid Gradient Algorithm
cites work: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
cites work: A primal-dual prediction-correction algorithm for saddle point optimization
cites work: Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes
cites work: Q4695311
cites work: Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
cites work: Smooth Optimization Approach for Sparse Covariance Selection
cites work: Understanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMM
cites work: Q4332942
cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
cites work: Alternating direction method for covariance selection models
cites work: A splitting algorithm for dual monotone inclusions involving cocoercive operators
DOI: 10.4208/NMTMA.OA-2023-0113
description: scientific article; zbMATH DE number 7966442