Numerical methods for large-scale non-convex quadratic programming

                 N.I.M. Gould and Ph. L. Toint
                         Report 01/01

In this paper we consider two state-of-the-art algorithms for large-scale
quadratic programming. Our aim is to illustrate the strengths and weaknesses
of the two approaches, and to give the reader some indication of the
sizes of problems that can now be (routinely) solved.