Content deleted Content added
No edit summary |
Add NP Guide ref |
||
Line 17:
If there are only equality constraints, then the QP can be solved by a [[linear system]]. Otherwise, the most common method of solving a QP is an [[interior point]] method, such as [http://www.orfe.princeton.edu/~loqo LOQO]. [[Active set]] methods are also commonly used.
==References==
* {{Book reference|Author = [[Michael R. Garey]] and [[David S. Johnson]] | Year = 1979 | Title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] | Publisher = W.H. Freeman | ID = ISBN 0716710455}} A6: MP2, pg.245.
==External links==
| |||