Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-0427(02)00420-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018624535 / rank | |||
Normal rank | |||
Latest revision as of 08:53, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global convergence of nonmonotone descent methods for unconstrained optimization problems |
scientific article |
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
