A Limited Memory Algorithm for Bound Constrained Optimization
- 1 September 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 16 (5), 1190-1208
- https://doi.org/10.1137/0916069
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Representations of quasi-Newton matrices and their use in limited memory methodsMathematical Programming, 1994
- LancelotPublished by Springer Nature ,1992
- Some numerical experiments with variable-storage quasi-Newton algorithmsMathematical Programming, 1989
- 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
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 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
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964