Finite termination of the proximal point algorithm

D.P. Bertsekas and J.N. Tsitsiklis,Parallel and Distributed Computation (Prentice-Hall, Englewood Cliffs, NJ, 1989). H. Brézis,Opérateurs Maximaux Monotones (North-Holland, Amsterdam, 1973). J.V. Burke and M.C. Ferris, “The sharpness of functions on sets,” in preparation (1991). R. De Leone and O.L. Mangasarian, “Serial and parallel solution of large scale linear programs by augmented Lagrangian successive overrelaxation,” in: A. Kurzhanski, K. Neumann and D. Pallaschke, eds.,Optimization, Parallel Processing and Applications. Lecture Notes in Economics and Mathematical Systems No. 304 (Springer-Verlag, Berlin, 1988) pp. 103–124. I. Ekeland, “On the variational principle,”Journal of Mathematical Analysis and Applications 47 (1974) 324–353. M.C. Ferris, “Weak sharp minima and penalty functions in mathematical programming,” Technical Report 779, Computer Sciences Department, University of Wisconsin (Madison, WI, 1988). O.L. Mangasarian, “Normal solutions of linear programs,”Mathematical Programming Study 22 (1984) 206–216. O.L. Mangasarian, “Error bounds for nondegenerate monotone linear complementarity problems,”Mathematical Programming (Series B) 48 (1990) 437–445. J.-J. Moreau, “Proximité et dualité dans un espace Hilbertien,”Bulletin de la Société Mathématique de France 93 (1965) 273–299. B.T. Polyak,Introduction to Optimization (Optimization Software, Publications Division, New York, 1987). B.T. Polyak and N.V. Tretiyakov, “Concerning an iterative method for linear programming and its economic interpretation,”Economics and Mathematical Methods 8 (1972) 740–751. R.T. Rockafellar, “Monotone operators and the proximal point algorithm,”SIAM Journal on Control and Optimization 14 (1976) 877–898.