Quadratic programming: Difference between revisions

Revision as of 17:01, 6 February 2006

Revision as of 21:25, 26 February 2006

Line 22:

==References==

* {{Bookcite referencebook|Authorauthor = [[Michael R. Garey]] and [[David S. Johnson]] | Yearyear = 1979 | Titletitle = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] | Publisherpublisher = W.H. Freeman | IDid = ISBN 0716710455}} A6: MP2, pg.245.

* {{Bookcite referencebook|Authorauthor = [[Jorge Nocedal]] and [[Stephen J. Wright]] | Yearyear = 1999 | Titletitle = [[Numerical Optimization]] | Publisherpublisher = Springer | IDid = ISBN 0387987932}} , pg.441.

* Quadratic programming with one negative eigenvalue is NP-hard, Panos M. Pardalos and Stephen A. Vavasis in Journal of Global Optimization, Volume 1, Number 1, 1991, pg.15-22.