Strictly Convex Quadratic Programming Solver
Project description
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.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
quadprog-0.1.0.tar.gz
(98.8 kB
view hashes)
