Algorithms for bound constrained quadratic programming problems
- 1 July 1989
- journal article
- research article
- Published by Springer Nature in Numerische Mathematik
- Vol. 55 (4) , 377-400
- https://doi.org/10.1007/bf01396045
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- A direct method for sparse least squares problems with lower and upper boundsNumerische Mathematik, 1988
- On Linear Restricted and Interval Least-Squares ProblemsIMA Journal of Numerical Analysis, 1988
- Quasi-Newton Updates with BoundsSIAM Journal on Numerical Analysis, 1987
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS11This research was supported by Air Force Office of Scientific Research Contract F44620-74-C-0079.Published by Elsevier ,1978
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976