A transformation of accelerated double step size method for unconstrained optimization (Q1665226)
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: A transformation of accelerated double step size method for unconstrained optimization |
scientific article; zbMATH DE number 6925953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A transformation of accelerated double step size method for unconstrained optimization |
scientific article; zbMATH DE number 6925953 |
Statements
A transformation of accelerated double step size method for unconstrained optimization (English)
0 references
27 August 2018
0 references
Summary: A reduction of the originally double step size iteration into the single step length scheme is derived under the proposed condition that relates two step lengths in the accelerated double step size gradient descent scheme. The proposed transformation is numerically tested. Obtained results confirm the substantial progress in comparison with the single step size accelerated gradient descent method defined in a classical way regarding all analyzed characteristics: number of iterations, CPU time, and number of function evaluations. Linear convergence of derived method has been proved.
0 references
0 references
0 references
0 references
