A hybrid steepest descent method for a split feasibility problem in Hilbert spaces

zbMATH Open1456.47022MaRDI QIDQ5142579FDOQ5142579

Authors:

Publication date: 31 December 2020

Full work available at URL: http://www.yokohamapublishers.jp/online2/opjnca/vol19/p1813.html

Recommendations

• Multi-step hybrid steepest-descent methods for split feasibility problems with hierarchical variational inequality problem constraints
• A hybrid steepest descent method for solving split feasibility problems involving nonexpansive mappings
• Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
• A fixed point method for solving a split feasibility problem in Hilbert spaces
• Strong convergence theorems by hybrid methods for split feasibility problems in Hilbert spaces

zbMATH Keywords

Hilbert spaceequilibrium problemsplit feasibility problemhybrid steepest descent method

Mathematics Subject Classification ID

Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25)

Cited In (4)

• Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem
• A hybrid steepest descent method for solving split feasibility problems involving nonexpansive mappings
• Multi-step hybrid steepest-descent methods for split feasibility problems with hierarchical variational inequality problem constraints
• The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems

This page was built for publication: A hybrid steepest descent method for a split feasibility problem in Hilbert spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5142579)