.png){kind=icon}
Return
Multivariate spectral gradient method for unconstrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.12.054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multivariate spectral gradient method is proposed for solving unconstrained optimization problems. Combined with some quasi-Newton property multivariate spectral gradient method allows an individual adaptive stepsize along each coordinate direction, which guarantees that the method is finitely convergent for positive definite quadratics. Especially, it converges no more than two steps for positive definite quadratics with diagonal Hessian, and quadratically for objective functions with positive definite diagonal Hessian. Moreover, based on a nonmonotone line search, global convergence is established for multivariate spectral gradient algorithm. At last numerical results are reported, which show that this method is promising and deserves further discussing. (c) 2008 Elsevier Inc. All rights reserved.
Keywords:
two-point stepsize gradient method
Barzilai-Borwein method
global convergence
unconstrained optimization
finite convergence
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
Influence of Modeling Liquids and Universal Adhesives Used as Lubricants on Color Stability and Translucency of Resin-Based Composites.png)
Coatings
OAAI
CoatingsIF0
OAAIShareSave
ShareSave
View more