The variance reduced Douglas-Rachford splitting method for large-scale optimization problems

DOI10.1007/S10915-026-03434-1MaRDI QIDQ7327241zbMATH OpenFDO

Authors Zehui Jia, Denghui Li, Zhiyu Liu, Deren Han

Publication date 9 September 2026

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-026-03434-1

Mathematics Subject Classification ID

Numerical analysis (65-XX) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A Convergent Incremental Gradient Method with a Constant Step Size
• A proximal stochastic gradient method with progressive variance reduction
• A Stochastic Approximation Method
• A stochastic preconditioned Douglas-Rachford splitting method for saddle-point problems
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
• An accelerated variance reducing stochastic method with Douglas-Rachford splitting
• An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Global convergence of splitting methods for nonconvex composite optimization
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 7255141 (Why is no real title available?)
• Lectures on convex optimization
• Monotone Operators and the Proximal Point Algorithm
• Multicomposite nonconvex optimization for training deep neural networks
• Peaceman-Rachford splitting for a class of nonconvex optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Stochastic alternating structure-adapted proximal gradient descent method with variance reduction for nonconvex nonsmooth optimization
• Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping

This page was built for publication: The variance reduced Douglas-Rachford splitting method for large-scale optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7327241)