Abstract
Fundamental insights into the properties of a function come from the study of its Moreau envelopes and Proximal point mappings. In this paper we examine the stability of these two objects under several types of perturbations. In the simplest case, we consider tilt-perturbations, i.e. perturbations which correspond to adding a linear term to the objective function. We show that for functions that have single-valued Lipschitz continuous proximal mappings, in particular for prox-regular functions, tilt-perturbations result in stable, i.e. single-valued Lipschitz continuous, proximal point mappings. In the more complex case, we consider the class of parametrically prox-regular functions. These include most of the functions that arise in the framework of nonlinear programming and its extensions (e.g. convex, lower-, strongly amenable (convexly composite)). New characterizations of prox-regularity are given and more general perturbations along the lines of A. B. Levy, R. A. Poliquin and R. T. Rockafellar [SIAM J. Optimization 10(2) (2000) 580–604] are studied. We show that under suitable conditions (compatible parameterization, positive coderivative,...), the proximal point mappings of the function depends in a Lipschitz fashion on the parameter u and the prox-parameter r.
References
- F. Bernard, L. Thibault. Prox-regular functions in Hilbert spaces, J. Math. Anal. Appl. 303(1) (2005) 1–14.https://doi.org/10.1016/j.jmaa.2004.06.003Google Scholar
- F. Bernard, L. Thibault, D. Zagrodny: Integration of primal lower nice functions in Hilbert spaces, J. Optimization Theory Appl. 124(3) (2005) 561–579.https://doi.org/10.1007/s10957-004-1174-zGoogle Scholar
- C. L. Chiriac: Proximal point algorithm with generalized Bregman functions, Fixed Point Theory 6(1) (2005) 25–32.Google Scholar
- M. C. Ferris: Finite termination of the proximal point algorithm, Math. Program., Ser. A 50(3) (1991) 359–366.https://doi.org/10.1007/BF01594944Google Scholar
- A. Hamdi: A primal-dual proximal point algorithm for constrained convex programs, Appl. Math. Comput. 162(1) (2005) 293–303.https://doi.org/10.1016/j.amc.2003.12.137Google Scholar
- W. L. Hare, A. S. Lewis: Identifying active constraints via partial smoothness and prox-regularity, J. Convex Analysis 11 (2004) 251–266.https://doi.org/10.68381/jca11017Google Scholar
- W. L. Hare, C. Sagastizábal: Computing proximal points of nonconvex functions, Math. Program., to appear.Google Scholar
- S. Ibaraki, M. Fukushima: Primal-dual proximal point algorithm for multicommodity network flow problems, J. Oper. Res. Soc. Japan 37(4) (1994) 297–309.https://doi.org/10.15807/jorsj.37.297Google Scholar
- A. Iusem, R. D. C. Monteiro: On dual convergence of the generalized proximal point method with Bregman distances, Math. Oper. Res. 25(4) (2000) 606–624.https://doi.org/10.1287/moor.25.4.606.12110Google Scholar
- A. N. Iusem, T. Pennanen, B. F. Svaiter: Inexact variants of the proximal point algorithm without monotonicity, SIAM J. Optim. 13(4) (2003) 1080–1097.https://doi.org/10.1137/S1052623401399587Google Scholar
- C. Lemaréchal, F. Oustry, C. Sagastizábal. The U -Lagrangian of a convex function, Trans. Amer. Math. Soc. 352(2) (2000) 711–729.https://doi.org/10.1090/S0002-9947-99-02243-6Google Scholar
- A. B. Levy, R. A. Poliquin, R. T. Rockafellar: Stability of locally optimal solutions, SIAM J. Optim. 10(2) (2000) 580–604.https://doi.org/10.1137/S1052623498348274Google Scholar
- B. Martinet. Régularisation d’inéquations variationnelles par approximations successives, Rev. Franç. Inform. Rech. Opér. 4(R-3) (1970) 154–158.https://doi.org/10.1051/m2an/197004R301541Google Scholar
- B. Martinet: Détermination approchée d’un point fixe d’une application pseudo-contractante. Cas de l’application prox, C. R. Acad. Sci., Paris, Sér. A 274 (1972) 163–165.Google Scholar
- R. Mifflin, C. Sagastizábal: Proximal points are on the fast track, J. Convex Analysis 9(2) (2002) 563–579.https://doi.org/10.68381/jca09033Google Scholar
- J.-J. Moreau. Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. Fr. 93 (1965) 273–299.https://doi.org/10.24033/bsmf.1625Google Scholar
- J.-J. Moreau: Propriétés des applications “prox”, C. R. Acad. Sci., Paris 256 (1963) 1069–1071.Google Scholar
- T. Pennanen: Local convergence of the proximal point algorithm and multiplier methods without monotonicity, Math. Oper. Res. 27(1) (2002) 170–191.https://doi.org/10.1287/moor.27.1.170.331Google Scholar
- R. A. Poliquin, R. T. Rockafellar: Generalized hessian properties of regularized nonsmooth functions, SIAM J. Optim. 6(4) (1996) 1121–1137.https://doi.org/10.1137/S1052623494279316Google Scholar
- R. A. Poliquin, R. T. Rockafellar: Prox-regular functions in variational analysis, Trans. Amer. Math. Soc. 348(5) (1996) 1805–1838.https://doi.org/10.1090/S0002-9947-96-01544-9Google Scholar
- R. A. Poliquin, R. T. Rockafellar: Tilt stability of a local minimum, SIAM J. Optim. 8(2) (1998) 287–299.https://doi.org/10.1137/S1052623496309296Google Scholar
- R. A. Poliquin, R. T. Rockafellar, L. Thibault: Local differentiability of distance functions, Trans. Amer. Math. Soc. 352(11) (2000) 5231–5249.https://doi.org/10.1090/S0002-9947-00-02550-2Google Scholar
- R. T. Rockafellar: Monotone operators and the proximal point algorithm, SIAM J. Control Optimization 14(5) (1976) 877–898.https://doi.org/10.1137/0314056Google Scholar
- R. T. Rockafellar, R. J.-B. Wets: Variational Analysis, Grundlehren der Mathematischen Wissenschaften 317, Springer, Berlin (1998).https://doi.org/10.1007/978-3-642-02431-3Google Scholar
Suggested citation
Published by Heldermann Verlag, 2007. Rights now held by Banach Press LLC.
