A bundle Bregman proximal method for convex nondifferentiable minimization

k} by taking xk to be an approximate minimizer of , where is a piecewise linear model of f constructed from accumulated subgradient linearizations of f, Dh is the D-function of a generalized Bregman function h and tk>0. Convergence under implementable criteria is established by extending our recent framework of Bregman proximal minimization, which is of independent interest, e.g., for nonquadratic multiplier methods for constrained minimization. In particular, we provide new insights into the convergence properties of bundle methods based on h=½|·|2.

[1]  O. Güler,et al.  Ergodic Convergence in Proximal Point Algorithms with Bregman Functions , 1994 .

[2]  K. Kiwiel.  Proximal Minimization Methods with Generalized Bregman Functions , 1997 .

[3]  Per Olov Lindberg,et al.  Dual Bregman proximal methods for large-scale 0-1 problems , 1996 .

[4]  A. Auslender.  Numerical methods for nondifferentiable convex optimization , 1987 .

[5]  Krzysztof C. Kiwiel,et al.  Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints , 1997, Math. Oper. Res..

[6]  Jonathan Eckstein,et al.  Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..

[7]  Marc Teboulle,et al.  Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..

[8]  J. Schwartz,et al.  Linear Operators. Part I: General Theory. , 1960 .

[9]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .

[10]  Osman Güer.  On the convergence of the proximal point algorithm for convex minimization , 1991 .

[11]  Paul Tseng,et al.  On the convergence of the exponential multiplier method for convex programming , 1993, Math. Program..

[12]  Jonathan Eckstein,et al.  Approximate iterations in Bregman-function-based proximal algorithms , 1998, Math. Program..

[13]  Stavros A. Zenios,et al.  On the Massively Parallel Solution of Linear Network Flow Problems , 1991, Network Flows And Matching.

[14]  Stavros A. Zenios,et al.  Massively Parallel Proximal Algorithms for Solving Linear Stochastic Network Programs , 1993, Int. J. High Perform. Comput. Appl..

[15]  Marc Teboulle,et al.  Entropic Proximal Mappings with Applications to Nonlinear Programming , 1992, Math. Oper. Res..

[16]  B. Lemaire.  On the Convergence of Some Iterative Methods for Convex Minimization , 1995 .

[17]  Per Olov Lindberg,et al.  Bregman Proximal Relaxation of Large-Scale 0–1 Problems , 2000, Comput. Optim. Appl..

[18]  Claude Lemaréchal,et al.  Convergence of some algorithms for convex minimization , 1993, Math. Program..

[19]  Y. Censor,et al.  Proximal minimization algorithm withD-functions , 1992 .

[20]  A. Iusem.  Some properties of generalized proximal point methods for quadratic and linear programming , 1995 .

[21]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[22]  K. Kiwiel.  A Cholesky dual method for proximal piecewise linear programming , 1994 .

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

[24]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[25]  Michael C. Ferris,et al.  Smooth methods of multipliers for complementarity problems , 1999, Math. Program..

[26]  B. Lemaire.  About the Convergence of the Proximal Method , 1992 .

[27]  Y. Censor,et al.  An iterative row-action method for interval convex programming , 1981 .

[28]  K. Kiwiel.  Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs , 1998 .

[29]  A. Iusem,et al.  Enlargement of Monotone Operators with Applications to Variational Inequalities , 1997 .

[30]  Krzysztof C. Kiwiel,et al.  Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..