.png){kind=icon}
.png){kind=icon}
Return
A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.10.042.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this paper is to incorporate the preconditioned gradient path in a nonmonotone stabilization algorithm for unconstrained optimization. The global convergence and locally superlinear convergence are established for this class of algorithms. Finally, we report in details the numerical results which show the effectiveness of the proposed algorithm. (C) 2010 Elsevier Inc. All rights reserved.
Keywords:
Unconstrained optimization
Gradient path
Nonmonotone technique
Globalization
Convergence
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W