Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem
From MaRDI portal
Publication:1725170
DOI10.1155/2014/870102zbMath1473.47043OpenAlexW2072213460WikidataQ59042188 ScholiaQ59042188MaRDI QIDQ1725170
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/870102
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems
- Some iterative methods for finding fixed points and for solving constrained convex minimization problems
- Averaged mappings and the gradient-projection algorithm
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
- Convergence of generalized proximal point algorithms
- Viscosity approximation methods for nonexpansive mappings
- Viscosity approximation methods for fixed-points problems
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Projected gradient methods for linearly constrained problems
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong convergence of modified algorithms based on the regularization for the constrained convex minimization problem