skip to navigation
skip to content

quadprog 0.1.6

Quadratic Programming Solver

Minimize 1/2 x^T G x - a^T x

Subject to C.T x >= b

This routine uses the the Goldfarb/Idnani dual algorithm [1].

References

  1. D. Goldfarb and A. Idnani (1983). A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27, 1-33.
 
File Type Py Version Uploaded on Size
quadprog-0.1.6.tar.gz (md5) Source 2015-10-12 105KB