Convergence of implementable descent algorithms for unconstrained optimization (Q1573997)
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 1486615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of implementable descent algorithms for unconstrained optimization |
scientific article; zbMATH DE number 1486615 |
Statements
Convergence of implementable descent algorithms for unconstrained optimization (English)
0 references
16 December 2001
0 references
Having the paper of \textit{A. N. Iusem} and \textit{B. F. Svaiter} about a proximal regularization of the steepest descent method [RAIRO-Rech. Opér. 29, 123-130 (1995; Zbl 0835.90066)] in mind and using quasi-Fejér convergence it is shown, that for quasiconvex objectives the whole sequence, obtained by a suitable descent algorithm with Armijo step size rule, is convergent.
0 references
descent algorithm
0 references
global convergence
0 references
stepsize rules
0 references
0.8324580788612366
0 references
0.8249380588531494
0 references
0.8183068633079529
0 references
0.8130077719688416
0 references
