Skip to main content
Log in

On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating

  • Published:
Mathematical Programming Submit manuscript

Abstract.

In previous work, the authors provided a foundation for the theory of variable metric proximal point algorithms in Hilbert space. In that work conditions are developed for global, linear, and super–linear convergence. This paper focuses attention on two matrix secant updating strategies for the finite dimensional case. These are the Broyden and BFGS updates. The BFGS update is considered for application in the symmetric case, e.g., convex programming applications, while the Broyden update can be applied to general monotone operators. Subject to the linear convergence of the iterates and a quadratic growth condition on the inverse of the operator at the solution, super–linear convergence of the iterates is established for both updates. These results are applied to show that the Chen–Fukushima variable metric proximal point algorithm is super–linearly convergent when implemented with the BFGS update.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: September 12, 1996 / Accepted: January 7, 2000¶Published online March 15, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burke, J., Qian, M. On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. Math. Program. 88, 157–181 (2000). https://doi.org/10.1007/PL00011373

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011373

Navigation