A general approximation method for a kind of convex optimization problems in Hilbert spaces
From MaRDI portal
Publication:2336172
DOI10.1155/2014/156073zbMath1437.47040OpenAlexW1997603494WikidataQ59050001 ScholiaQ59050001MaRDI QIDQ2336172
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/156073
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Cites Work
- Some results on a general iterative method for \(k\)-strictly pseudo-contractive mappings
- A viscosity of Cesàro mean approximation methods for a mixed equilibrium, variational inequalities, and fixed point problems
- A general iterative algorithm for nonexpansive mappings in Hilbert spaces
- A hybrid extragradient viscosity approximation method for solving equilibrium problems and fixed point problems of infinitely many nonexpansive mappings
- A multiprojection algorithm using Bregman projections in a product space
- Equilibrium programming using proximal-like algorithms
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- Projection methods for variational inequalities with application to the traffic assignment problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
