Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- 14 December 2007
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 222 (2) , 429-439
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On Augmented Lagrangian Methods with General Lower-Level ConstraintsSIAM Journal on Optimization, 2008
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualificationMathematical Programming, 2006
- Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected GradientsComputational Optimization and Applications, 2002
- A Limited Memory Algorithm for Bound Constrained OptimizationSIAM Journal on Scientific Computing, 1995
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Numerical Analysis, 1991
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982