Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis

作者：Karmitsa Napsu^*; Makela Marko M

来源：Optimization Methods and Software, 2010, 25(6): 895-916.

DOI：10.1080/10556780902842495

• nondifferentiable programming
• large-scale optimization
• bundle methods
• limited memory methods
• box constraints
• global convergence

Practical optimization problems often involve nonsmooth functions of hundreds or thousands of variables. As a rule, the variables in such large problems are restricted to certain meaningful intervals. In the article [N. Karmitsa and M.M. Makela, Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization, Optimization (to appear)], we described an efficient limited-memory bundle method for large-scale nonsmooth, possibly nonconvex, bound constrained optimization. Although this method works very well in numerical experiments, it suffers from one theoretical drawback, namely, that it is not necessarily globally convergent. In this article, a new variant of the method is proposed, and its global convergence for locally Lipschitz continuous functions is proved.

• 出版日期2010