A note on Solodov and Tseng's methods for maximal monotone mappings
From MaRDI portal
Publication:972763
DOI10.1016/j.cam.2010.02.032zbMath1190.47080OpenAlexW2038921470MaRDI QIDQ972763
Qingzhi Yang, Hongxiu Gao, Jin-Ling Zhao
Publication date: 21 May 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.02.032
relaxationorthogonal projectionproximal point algorithmmaximal monotoneforward-backward splitting method
Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed projection method for variational inequalities
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- On Projection Algorithms for Solving Convex Feasibility Problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: A note on Solodov and Tseng's methods for maximal monotone mappings