A memory gradient method with a new nonmonotone line search rule
Based on nonmonotone Armijo line search, the paper proposes a new nonmonotone line search and investigates a memory gradient method with this line search. Its global convergence is also proved under some mild conditions. As compared with nonmonotone Armijo rule, the new nonmonotone line search can e...
Saved in:
Published in | 2010 IEEE International Conference on Progress in Informatics and Computing Vol. 1; pp. 59 - 62 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2010
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Based on nonmonotone Armijo line search, the paper proposes a new nonmonotone line search and investigates a memory gradient method with this line search. Its global convergence is also proved under some mild conditions. As compared with nonmonotone Armijo rule, the new nonmonotone line search can effectively reduce the function evaluations by choosing a larger accepted stepsize at each iteration so as to reduce the computation of algorithm. |
---|---|
ISBN: | 1424467888 9781424467884 |
DOI: | 10.1109/PIC.2010.5687399 |