An Approximate Proximal Point Algorithm for Maximal Monotone Inclusion Problems

الملخص EN

This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces.

The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations.

As applications, convex programming problems and generalized variational inequalities are considered.

Some preliminary computational results are reported.