On the Solution of Large Quadratic Programming Problems with Bound Constraints

This publication has 20 references indexed in Scilit:

• A direct active set algorithm for large sparse quadratic programs with simple bounds
  Mathematical Programming, 1989
• On the Identification of Active Constraints
  SIAM Journal on Numerical Analysis, 1988
• A direct method for sparse least squares problems with lower and upper bounds
  Numerische Mathematik, 1988
• Testing a class of methods for solving minimization problems with simple bounds on the variables
  Mathematics of Computation, 1988
• Projected gradient methods for linearly constrained problems
  Mathematical Programming, 1987
• Projected Newton Methods for Optimization Problems with Simple Constraints
  SIAM Journal on Control and Optimization, 1982
• Mixed finite elements in ?3
  Numerische Mathematik, 1980
• On the solution of large, structured linear complementarity problems: The block partitioned case
  Applied Mathematics & Optimization, 1977
• On a problem of the theory of lubrication governed by a variational inequality
  Applied Mathematics & Optimization, 1976
• On the Goldstein-Levitin-Polyak gradient projection method
  IEEE Transactions on Automatic Control, 1976