*(English)*Zbl 0930.65072

Summary: Interest in the variable metric proximal point algorithm (VMPPA) is fueled by the desire to accelerate the local convergence of the proximal point algorithm without requiring the divergence of the proximation parameters. In this paper, the local convergence theory for matrix secant versions of the VMPA is applied to a known globally convergent version of the algorithm. It is shown under appropriate hypotheses that the resulting algorithms are locally superlinearly convergent when executed with the BFGS and the Broyden matrix secant updates.

This result unifies previous work on the global and local convergence theory for this class of algorithms. It is the first result applicable to general monotone operators showing that a globally convergent VMPPA with bounded proximation parameters can be accelerated using matrix secant techniques. This result clears the way for the direct application of these methods to constrained and non-finite-valued convex programming. Numerical experiments are included illustrating the potential gains of the method and issues for further study.

##### MSC:

65K05 | Mathematical programming (numerical methods) |

90C25 | Convex programming |

90C51 | Interior-point methods |