An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter.
In: SIAM Journal on Optimization, Jg. 16 (2005-10-08), Heft 1, S. 146-169
academicJournal
Zugriff:
Global convergence in constrained optimization algorithms has traditionally been enforced by the use of parametrized penalty functions. Recently, the filter strategy has been introduced as an alternative. At least part of the motivation for using filter methods consists of avoiding the need for estimating a suitable penalty parameter, which is often a delicate task. In this paper, we demonstrate that the use of a parametrized penalty function in nonsmooth convex optimization can be avoided without using the relatively complex filter methods. We propose an approach which appears to be more direct and easier to implement, in the sense that it is closer in spirit and structure to the well-developed unconstrained bundle methods. Preliminary computational results are also reported. [ABSTRACT FROM AUTHOR]
Copyright of SIAM Journal on Optimization is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Titel: |
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter.
|
---|---|
Autor/in / Beteiligte Person: | Solodov, Claudia Sagastizábal ; Solodov, Mikhail |
Zeitschrift: | SIAM Journal on Optimization, Jg. 16 (2005-10-08), Heft 1, S. 146-169 |
Veröffentlichung: | 2005 |
Medientyp: | academicJournal |
ISSN: | 1052-6234 (print) |
DOI: | 10.1137/040603875 |
Schlagwort: |
|
Sonstiges: |
|