[1] M\"{a}kel\"{a} M M. Survey of bundle methods for nonsmooth optimization [J]. Optimization Methods and Software, 2002, 17(1): 1-29.
[2] Kiwiel K C. A projection-proximal bundle method for convex nondifferentiable minimization [M]//Ill-posed Variational Problems and Regularization Techniques, Berlin: Springer, 1999, 137-150.
[3] Sagastizabal C, Solodov M. An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter [J]. SIAM Journal on Optimization, 2005, 16(1): 146-169.
[4] Kiwiel K C. Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization [J]. Mathematical Programming, 1991, 52: 285-302.
[5] Kiwiel K C. A proximal bundle method with approximate subgradient linearizations [J]. SIAM Journal on optimization, 2006, 16(4): 1007-1023.
[6] Kiwiel K C. An ellipsoid trust region bundle method for nonsmooth convex minimization [J]. SIAM Journal on control and optimization, 1989, 27(4): 737-757.
[7] Cruz J B, Oliveira W. Level bundle-like algorithms for convex optimization [J]. Journal of Global Optimization, 2014, 59(4): 787-809.
[8] 高岩. 非光滑优化 [M]. 北京:科学出版社, 2008.
[9] Oliveira W, Solodov M. A doubly stabilized bundle method for nonsmooth convex optimization [J]. Mathematical programming, 2016, 156(1): 125-159.
[10] Shen J, Li D, Pang L P. A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions [J]. Abstract and Applied Analysis, 2014, Doi:10.1155/2014/192893.
[11] Astorino A, Frangioni A, Gaudioso M, et al. Piecewise quadratic approximations in convex numerical optimization [J]. SIAM Journal on Optimization, 2011, 21(4): 1418-1438.
|