Change search
ReferencesLink to record
Permanent link

Direct link
Globally Convergent Limited Memory Bundle Method for Large-Scale Nonsmooth Optimization
School of Computational and Applied Mathematics, University of the Witwatersrand.
Helsinki School of Economics.
Department of Mathematical Information Technology, University of Jyväskylä.
2007 (English)In: Mathematical programming, ISSN 0025-5610, E-ISSN 1436-4646, Vol. 109, no 1, 181-205 p.Article in journal (Refereed) Published
Abstract [en]

Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, Mäkelä, Optimization Methods and Software, 19, (2004), pp. 673-692] we have described an efficient method for large-scale nonsmooth optimization. In this paper, we introduce a new variant of this method and prove its global convergence for locally Lipschitz continuous objective functions, which are not necessarily differentiable or convex. In addition, we give some encouraging results from numerical experiments.

Place, publisher, year, edition, pages
2007. Vol. 109, no 1, 181-205 p.
Keyword [en]
Nondifferentiable programming - Large-scale optimization - Bundle methods - Variable metric methods - Limited memory methods - Global convergence
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-83539DOI: 10.1007/s10107-006-0728-2ISI: 000242463900008OAI: diva2:498817
QC 20120220Available from: 2012-02-12 Created: 2012-02-12 Last updated: 2012-02-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Miettinen, Kaisa
In the same journal
Mathematical programming
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 27 hits
ReferencesLink to record
Permanent link

Direct link