New limited memory bundle method for large-scale nonsmooth optimization
- 1 December 2004
- journal article
- other
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 19 (6) , 673-692
Abstract
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of hundreds or thousands of variables. In such problems, the direct application of smooth gradient-based methods may lead to a failure due to the nonsmooth nature of the problem. On the other hand, none of the current general nonsmooth optimization methods is efficient in large-scale settings. In this article, we describe a new limited memory variable metric based bundle method for nonsmooth large-scale optimization. In addition, we introduce a new set of academic test problems for large-scale nonsmooth minimization. Finally, we give some encouraging results from numerical experiments using both academic and practical test problems.Keywords
This publication has 18 references indexed in Scilit:
- Survey of Bundle Methods for Nonsmooth OptimizationOptimization Methods and Software, 2002
- Comparison of formulations and solution methods for image restoration problemsInverse Problems, 2001
- Globally Convergent Variable Metric Method for Nonconvex Nondifferentiable Unconstrained MinimizationJournal of Optimization Theory and Applications, 2001
- Globally Convergent Variable Metric Method for Convex Nonsmooth Unconstrained Minimization1Journal of Optimization Theory and Applications, 1999
- BFGS with Update Skipping and Varying MemorySIAM Journal on Optimization, 1998
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex MinimizationSIAM Journal on Control and Optimization, 1989
- Partitioned variable metric updates for large structured optimization problemsNumerische Mathematik, 1982
- Updating quasi-Newton matrices with limited storageMathematics of Computation, 1980
- On sparse and symmetric matrix updating subject to a linear equationMathematics of Computation, 1977