The conjugate gradient method for split variational inclusion and constrained convex minimization problems
DOI10.1016/j.amc.2016.06.007zbMath1410.47017OpenAlexW2491900265MaRDI QIDQ1733715
Publication date: 21 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.06.007
conjugate gradient methodviscosity approximation methodconvex minimization problemsplit variational inclusion problemfixed point problem
Monotone operators and generalizations (47H05) Nonlinear accretive operators, dissipative operators, etc. (47H06) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (14)
Cites Work
- Unnamed Item
- A simultaneous iterative method for split equality problems of two finite
- Generalized viscosity approximation methods for nonexpansive mappings
- Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
- Split monotone variational inclusions
- Averaged mappings and the gradient-projection algorithm
- Algorithms for the split variational inequality problem
- A hybrid viscosity algorithm via modify the hybrid steepest descent method for solving the split variational inclusion in image reconstruction and fixed point problems
- Viscosity approximation methods for nonexpansive mappings
- An iterative method for split variational inclusion problem and fixed point problem for a nonexpansive mapping
- The split common fixed-point problem for demicontractive mappings
- Some problems and results in the study of nonlinear analysis
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The Split Common Null Point Problem
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: The conjugate gradient method for split variational inclusion and constrained convex minimization problems