Splitting methods for a convex feasibility problem in Hilbert spaces
DOI10.22436/JNSA.009.05.60zbMATH Open1347.47049OpenAlexW2793554903MaRDI QIDQ2812331FDOQ2812331
Publication date: 16 June 2016
Published in: Journal of Nonlinear Science and Applications (Search for Journal in Brave)
Full work available at URL: http://www.tjnsa.com/includes/files/articles/Vol9_Iss5_2638--2648_Splitting_methods_for_a_convex_feas.pdf
Recommendations
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- Iterative methods for generalized split feasibility problems in Hilbert spaces
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- A regularization algorithm for a splitting feasibility problem in Hilbert spaces
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)
Cited In (4)
This page was built for publication: Splitting methods for a convex feasibility problem in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2812331)
