Strong Convergence of Modified Algorithms Based on the Regularization for the Constrained Convex Minimization Problem

Abstract EN

As is known, the regularization method plays an important role in solving constrained convex minimization problems.

Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by the algorithms can converge strongly to a solution of the constrained convex minimization problem, which also solves a certain variational inequality.

As an application, we also apply the algorithm to solve the split feasibility problem.