Nonmonotone bundle-type scheme for convex nonsmooth minimization |
| |
Authors: | F. Facchinei S. Lucidi |
| |
Affiliation: | (1) Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza,, Roma, Italy;(2) Istituto di Analisi dei Sistemi ed Informatica del CNR, Roma, Italy |
| |
Abstract: | In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. |
| |
Keywords: | Convex programming nonsmooth optimization bundle methods nonmonotone algorithms |
本文献已被 SpringerLink 等数据库收录! |
|