The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
Jitsupa Deepho, Poom Kumam · Abstract and Applied Analysis · 2014
We introduced an implicit and an explicit iteration method based on the hybrid steepest descent method for finding a common element of the set of solutions of a constrained convex minimization problem and the set of solutions of a split variational inclusion problem.