.png){kind=icon}
Return
A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.06.119.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An active set limited memory BFGS algorithm for large-scale bound constrained optimization is introduced. The active sets are based on guessing technique to be identified at each iteration, the search direction in free subspace is determined by limited memory BFGS (L-BFGS) algorithm, which provides an efficient means for attacking large-scale optimization problems. The implementations of the method on CUTE test problems are described. (c) 2006 Elsevier Inc. All rights reserved.
Keywords:
nonlinear optimization
bound constrained problem
limited memory method
stationary point
gradient projection method
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more