The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5286516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions |
scientific article; zbMATH DE number 5286516 |
Statements
The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (English)
0 references
11 June 2008
0 references
The principal aim of this article is to establish the superlinear convergence of the nonmonotone Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm proposed by \textit{J. Han} and \textit{G. Liu} [Comput. Optim. Appl. 7, No. 3, 277--289 (1997; Zbl 0876.90072)] for the numerical solution of unconstrained convex optimization problems, under appropriate assumptions.
0 references
unconstrained convex optimization
0 references
nonmonotone line search
0 references
superlinear convergence
0 references
0 references
0 references
0 references
0 references
0 references
0.8928421139717102
0 references
0.8899633884429932
0 references
0.8427257537841797
0 references
0.8318607211112976
0 references
0.8310108184814453
0 references
