论文信息 - Finite termination of the proximal point algorithm - 字舞流文

Finite termination of the proximal point algorithm

This paper concerns the notion of a sharp minimum on a set and its relationship to the proximal point algorithm. We give several equivalent definitions of the property and use the notion to prove finite termination of the proximal point algorithm.

Michael C. Ferris | M. Ferris

[1] O. Mangasarian,et al. Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation , 1988 .

[2] Gian-Carlo Rota. Opérateurs maximaux monotones: H. Brézis, North-Holland, 1983, 183 pp. , 1985 .

[3] Michael C. Ferris,et al. Weak sharp minima and penalty functions in mathematical programming , 1988 .

[4] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[5] J. Moreau. Proximité et dualité dans un espace hilbertien , 1965 .

[6] Olvi L. Mangasarian,et al. Error bounds for nondegenerate monotone linear complementarity problems , 1990, Math. Program..

[7] I. Ekeland. On the variational principle , 1974 .

[8] O. Mangasarian. Normal solutions of linear programs , 1984 .

[9] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .