Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces

DOI10.1002/mma.5654OpenAlexW2945345720WikidataQ127816219 ScholiaQ127816219MaRDI QIDQ5240277

Zeynab Jouymandi, Fridoun Moradlou

Publication date: 25 October 2019

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.5654

zbMATH Keywords

equilibrium problemsplit feasibility problemextragradient algorithmlinesearch algorithmLipschitz-type condition

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Equations involving nonlinear operators (general) (47J05)

Related Items (4)

Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ New inertial relaxed method for solving split feasibilities

This page was built for publication: Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces