A general framework for inexact splitting algorithms with relative errors and applications to Chambolle–Pock and Davis–Yin methods
- 16 October 2025
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 93 (2) , 729-763
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Institutional Internationalization Program (CAPES-PRINT/UFSC)
- CNPq (308036/2021-2)
- Alexander von Humboldt-Stiftung
- Air Force Office of Scientific Research (FA8655-22-1-7034)
- MUR Excellence Department Project (CUP D33C2300111000)
This publication has 45 references indexed in Scilit:
- Resolvent splitting for sums of monotone operators with minimal liftingMathematical Programming, 2022
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithmsComputational Optimization and Applications, 2020
- Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splittingMathematical Programming, 2019
- Mathematical Image Processing2018
- Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMMMathematical Programming, 2017
- Convex Analysis and Monotone Operator Theory in Hilbert Spaces2017
- A practical relative error criterion for augmented LagrangiansMathematical Programming, 2012
- A splitting algorithm for dual monotone inclusions involving cocoercive operatorsAdvances in Computational Mathematics, 2011
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992