A hybrid steepest descent method for a split feasibility problem in Hilbert spaces
From MaRDI portal
Publication:5142579
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
Cited in
(4)- The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
- Multi-step hybrid steepest-descent methods for split feasibility problems with hierarchical variational inequality problem constraints
- 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
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)