A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables

This publication has 19 references indexed in Scilit:

• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
  Mathematical Programming, 1994
• A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
  SIAM Journal on Optimization, 1993
• A globally and quadratically convergent affine scaling method for linearℓ 1 problems
  Mathematical Programming, 1992
• A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
  SIAM Journal on Numerical Analysis, 1992
• A Class of penalty functions for optimization problema with bound constraints
  Optimization, 1992
• A direct active set algorithm for large sparse quadratic programs with simple bounds
  Mathematical Programming, 1989
• A direct method for sparse least squares problems with lower and upper bounds
  Numerische Mathematik, 1988
• Approximate solution of the trust region problem by minimization over two-dimensional subspaces
  Mathematical Programming, 1988
• Testing a class of methods for solving minimization problems with simple bounds on the variables
  Mathematics of Computation, 1988
• Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
  IMA Journal of Applied Mathematics, 1974