Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Global convergence of nonmonotone descent methods for unconstrained optimization problems |
scientific article; zbMATH DE number 1801720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global convergence of nonmonotone descent methods for unconstrained optimization problems |
scientific article; zbMATH DE number 1801720 |
Statements
Global convergence of nonmonotone descent methods for unconstrained optimization problems (English)
0 references
17 September 2002
0 references
This paper deals with global convergence for unconstrained optimization algorithms that utilize a nonmonotone line search procedure. The proposed technique allows the user to specify a flexible facing function and includes Armijo, Goldstein and Wolfe rules as special cases. The global convergence (towards stationary points) of the nonmonotone descent method for unconstrained optimization is proved.
0 references
unconstrained optimization
0 references
nonmonotone line search
0 references
global convergence
0 references
algorithms
0 references
0 references
0 references
0 references
0.8636571168899536
0 references
0.8613619208335876
0 references
0.8609840273857117
0 references
0.8598154783248901
0 references
0.8533006906509399
0 references
