.png){kind=icon}
.png){kind=icon}
Return
A compact limited memory method for large scale unconstrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.02.045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A compact limited memory method for solving large scale unconstrained optimization problems is proposed. The compact representation of the quasi-Newton updating matrix is derived to the use in the form of limited memory update in which the vector y(k) is replaced by a modified vector y(k) so that more available information about the function can be employed to increase the accuracy of Hessian approximations. The global convergence of the proposed method is proved. Numerical tests on commonly used large scale test problems indicate that the proposed compact limited memory method is competitive and efficient. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
large scale optimization
nonlinear programming
limited memory quasi-Newton method
BFGS update
modified quasi-Newton equation
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available