An active set limited memory BFGS algorithm for bound constrained optimization
Authors:
- Gonglin YuanGYGonglin Yuan
- Xiwen LuXLXiwen Lu
- 1 July 2011
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 35 (7) , 3561-3573
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- New line search methods for unconstrained optimizationJournal of the Korean Statistical Society, 2009
- A modified PRP conjugate gradient methodAnnals of Operations Research, 2008
- The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functionsActa Mathematica Sinica, English Series, 2008
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimizationApplied Mathematics and Computation, 2007
- Algorithm 813ACM Transactions on Mathematical Software, 2001
- A modified BFGS method and its global convergence in nonconvex minimizationJournal of Computational and Applied Mathematics, 2001
- Algorithm 778: L-BFGS-BACM Transactions on Mathematical Software, 1997
- A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimizationMathematics of Computation, 1997
- CUTEACM Transactions on Mathematical Software, 1995
- A fast algorithm for nonlinearly constrained optimization calculations1978