Revision as of 02:11, 2 July 2006 edit Dpv (talk \| contribs) 4,945 edits m Disambiguation link repair - You can help! (convex) ← Previous edit		Revision as of 13:35, 24 July 2006 edit undo A quant (talk \| contribs) 26 edits link to LP article Next edit →
Line 25: * {{cite book\|author = [[Jorge Nocedal]] and [[Stephen J. Wright]] \| year = 1999 \| title = [[Numerical Optimization]] \| publisher = Springer \| id = 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. ==See also== *[[Linear programming]] ==External links==

Quadratic programming: Difference between revisions