Content deleted Content added
→Relation to quadratic programming: <ref name="Todd" > {{cite journal|last=Todd|first=Michael J.|authorlink=Michael J. Todd (mathematician)|title=Linear and quadratic programming in oriented matroids|journal=Journal of Combinatorial Theory|s |
|||
Line 93:
In fact, most QP solvers work on the LCP formulation, including the [[interior point method]], principal / complementarity pivoting and [[active set]] methods. LCP problems can be solved by the [[criss-cross algorithm]], even when they are formulated abstractly using [[oriented matroid|oriented-matroid]] theory.<ref name="Todd" > {{cite journal|last=Todd|first=Michael J.|authorlink=Michael J. Todd (mathematician)|title=Linear and quadratic programming in oriented matroids|journal=Journal of Combinatorial Theory|series=Series B|volume=39|year=1985|number=2|pages=105–133|MR=811116|doi=10.1016/0095-8956(85)90042-5|url=http://dx.doi.org/10.1016/0095-8956(85)90042-5|ref=harv}} </ref>
== See also ==
| |||