Dual Bregman proximal methods for large-scale 0-1 problems
暂无分享,去创建一个
[1] Y. Censor,et al. An iterative row-action method for interval convex programming , 1981 .
[2] Krzysztof C. Kiwiel,et al. Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints , 1997, Math. Oper. Res..
[3] Jonathan Eckstein,et al. Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..
[4] K. Kiwiel. Proximal Minimization Methods with Generalized Bregman Functions , 1997 .
[5] Marc Teboulle,et al. Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..
[6] Y. Censor,et al. Proximal minimization algorithm withD-functions , 1992 .