CONVERGENCE OF GENERALIZED CONTRACTION-PROXIMAL POINT ALGORITHMS FOR SOLVING UNCONSTRAINED CONVEX OPTIMIZATION PROBLEMS

Abstract

In this paper, we get new contraction-proximal point algorithms for solving the unconstrained convex optimization problems. We also get the relative strong convergence under some conditions. It also extends the use of already existing algorithms.