Iterative methods for constrained convex minimization problem in Hilbert spaces
Ming Tian, Lihua Huang · Fixed Point Theory and Applications · 2013
In this paper, based on Yamada’s hybrid steepest descent method, a general iterative method is proposed for solving constrained convex minimization problem. It is proved that the sequences generated by proposed implicit and explicit schemes converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality. MSC: 58E35, 47H09, 65J15.