Learn More
In previous work, the authors provided a foundation for the theory of variable metric proximal point algorithms for general monotone operators on a Hilbert space. In particular, they develop conditions for the global, linear, and super{linear convergence of their proposed algorithm. This paper focuses attention on two matrix secant updating strategies for(More)
Let C be a nonempty closed subset of the real normed linear space X. In this paper we determine the extent to which formulas for the Clarke subdifferential of the distance for C, de(x) := inf I/Y-.rll, be< which are valid when C is convex, remain valid when C is not convex. The assumption of subdifferential regularity for d, plays an important role. When x(More)
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 implementations of the VMPPA is applied to a globally convergent(More)
  • 1