Abstract
We consider the problem inf fx ≔ f + i x, where f is a closed proper convex function and i x is the indicator function of a closed convex set X in a real Hilbert space. We study an inexact proximal point algorithm under mild conditions on accuracy tolerances that ensure weak convergence of its iterates to a solution, or strong convergence when fx is boundedly well-set. We also give a bundle method for minimizing fx. At each iteration, it finds a trial point by minimizing a simple “unconstrained” polyhedral model of fx augmented with a proximal term, and projecting a certain point onto X. We establish convergence of descent and nondescent versions. Finally, we discuss an application in Tikhonov’s regularization of ill-posed minimization problems.
Research supported by State Committee for Scientific Research Grant 8T11A00115.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Auslender, Numerical methods for nondifferentiable convex optimization, Math. Programming Stud. 30 (1986) 102–126.
M. A. Bahraoui, Suites diagonalement stationnaires en optimisation convexe, These de doctorat, Université Montpellier II, Montpellier, France, 1994.
M. A. Bahraoui and B. Lemaire, Approximate proximal point algorithm and bundle methods for constrained convex minimization, Tech. report, Mathématiques, Université Montpellier II, Montpellier, 1995.
H. Brézis and P.-L. Lions, Produits infinis de résolvantes, Israel J. Math. 29 (1978) 329–345.
R. Cominetti, Coupling the proximal point algorithm with approximation methods, J. Optim. Theory Appl. 95 (1997) 581–600.
O. Cornejo, A. Jourani and C. Zălinescu, Conditioning and upper-lipschitz inverse subdifferentials in nonsmooth optimization problems, J. Optim. Theory Appl. 95 (1997) 127–148.
R. Correa and C. Lemaréchal, Convergence of some algorithms for convex minimization, Math. Programming 62 (1993) 261–275.
N. Dunford and J. T. Schwartz, Linear Operators, Part I: General Theory, Wiley-Interscience, New York, 1988.
J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Programming 55 (1992) 293–318.
O. Güler, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim. 29 (1991) 403–419.
J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
K. C. Kiwiel, A method for solving certain quadratic programming problems arising in nonsmooth optimization, IMA J. Numer. Anal. 6 (1986) 137–152.
—, Proximity control in bundle methods for convex nondifferentiable minimization, Math. Programming 46 (1990) 105–122.
—, A Cholesky dual method for proximal piecewise linear programming, Numer. Math. 68 (1994) 325–340.
—, Proximal minimization methods with generalized Bregman functions, SIAM J. Control Optim. 35 (1997) 1142–1168.
—, A bundle Bregman proximal method for convex nondifferentiable minimization, Math. Programming? (1998). To appear.
B. Lemaire, The proximal algorithm, in New Methods in Optimization and Their Industrial Uses, J. P. Penot, ed., International Series of Numerical Mathematics 87, Birkhäuser, Basel, 1989, pp. 73–87.
—, About the convergence of the proximal method, in Advances in Optimization, W. Oettli and D. Pallaschke, eds., Lecture Notes in Economics and Mathematical Systems 382, Springer-Verlag, Berlin, 1992, pp. 39–51.
—, Bounded diagonally stationary sequences in convex optimization, J. Convex Anal. 1 (1994) 75–86.
—, On the convergence of some iterative methods for convex minimization, in Recent Developments in Optimization, R. Durier and C. Michelot, eds., Lecture Notes in Economics and Mathematical Systems 429, Springer-Verlag, Berlin, 1995, pp. 252–268.
B. Martinet, Régularisation d’inéquations variationelles par approximations successives, RAIRO Rech. Opér. 4(R3) (1970) 154–158.
J.-P. Penot, Conditioning convex and nonconvex problems, J. Optim. Theory Appl. 90 (1996) 535–554.
B. T. Polyak, Introduction to Optimization, Nauka, Moscow, 1983. English transl., Optimization Software Inc., New York, 1987.
R. T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877–898.
P. Shunmugaraj, Well-set and well-posed minimization problems, Set-Valued Anal. 3 (1995) 281–294.
A. N. Tikhonov and V. Ya. Arsenin, Methods for Solving Ill-Posed Problems, Nauka, Moscow, 1974 (Russian).
A. N. Tikhonov and V. Ya. Arsenin, English transl., Solutions of Ill-Posed Problems, Wiley, New York, 1977.
T. Zolezzi, Extended well-posedness of optimization problems, J. Optim. Theory Appl. 91 (1996) 257–266.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiwiel, K.C. (1999). A Projection-Proximal Bundle Method for Convex Nondifferentiable Minimization. In: Théra, M., Tichatschke, R. (eds) Ill-posed Variational Problems and Regularization Techniques. Lecture Notes in Economics and Mathematical Systems, vol 477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45780-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-45780-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66323-2
Online ISBN: 978-3-642-45780-7
eBook Packages: Springer Book Archive