On the Solution of Large Quadratic Programming Problems with Bound Constraints
- 1 February 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (1), 93-113
- https://doi.org/10.1137/0801008
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- A direct active set algorithm for large sparse quadratic programs with simple boundsMathematical Programming, 1989
- 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
- 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
- Mixed finite elements in ?3Numerische Mathematik, 1980
- On the solution of large, structured linear complementarity problems: The block partitioned caseApplied Mathematics & Optimization, 1977
- On a problem of the theory of lubrication governed by a variational inequalityApplied Mathematics & Optimization, 1976
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976