A bundle Bregman proximal method for convex nondifferentiable minimization |
| |
Authors: | Krzysztof C. Kiwiel |
| |
Affiliation: | (1) Systems Research Institute, Newelska 6, 01–447 Warsaw, Poland, e-mail: kiwiel@ibspan.waw.pl, PL |
| |
Abstract: | 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. Received September 18, 1997 / Revised version received June 30, 1998 Published online November 24, 1998 |
| |
Keywords: | : convex programming – nondifferentiable optimization – proximal methods – bundle methods – Bregman functions – B-functions Mathematics Subject Classification (1991): 65K05, 90C25 |
本文献已被 SpringerLink 等数据库收录! |
|