中文

Operations Research Transactions >

2016 , Vol. 20 >Issue 2: 113 - 120

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.02.011

A hybrid bundle method for nonsmooth convex optimization

Expand
  • 1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China

Received date: 2014-10-13

  Online published: 2016-06-15

Fold

Abstract

A hybrid bundle method for nonsmooth convex optimization problems is proposed. In this method, the next iterate point is obtained by solving a subproblem which is formed by adding proximal term to the objective function and trust region constraint to the feasible region. The proposed algorithm combines proximal bundle method with trust region bundle method and switches between them automatically. Convergence analysis shows that the algorithm we proposed is global convergent. Finally, a numerical example is given to verify the validity of the method we proposed.

Key words： nonsmooth optimization; proximal bundle method; trust region bundle method

Cite this article

ZHANG Qingye, GAO Yan . A hybrid bundle method for nonsmooth convex optimization[J]. Operations Research Transactions, 2016 , 20(2) : 113 -120 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.02.011

References

[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.

 

Options
Outlines

/

〈 〉