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
D. Goldfarb and A. Idnani (1983). A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27, 1-33.
Project details
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.2.tar.gz
(98.7 kB
view hashes)
Built Distributions
Close
Hashes for quadprog-0.1.2-cp35-cp35m-macosx_10_5_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | d8904935a2cf765ce69d337ed3dd9396218f17587c53ab557606ef2b20dd5dda |
|
MD5 | 8e9dfa441a784aec9bc22b1016191250 |
|
BLAKE2b-256 | 05e67b3071b410241e3dd690ef49c53535f78dca9f1b0887b4fce2b3b1f8f8a6 |
Close
Hashes for quadprog-0.1.2-cp34-cp34m-macosx_10_5_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 16f337b7d3626e5d4c118ab8d0e81cfd558d0248c67d7e0c17441ec513b65568 |
|
MD5 | 09ddbb86a68f47e7f8e5b314c2a4e7b4 |
|
BLAKE2b-256 | 70fdfa15ba98e0875ea7018842ea9883ba8e06e69734ba5dfc1a38a33302bbf6 |
Close
Hashes for quadprog-0.1.2-cp33-cp33m-macosx_10_5_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 203a2b23ceb87a7f3b3400661146bae3d6127571a2b9dbc2d0217cc31867b2aa |
|
MD5 | d15bc6bc5b2e52b99a025218a9f4f151 |
|
BLAKE2b-256 | cdf3e31b9f7832a68db286d3034afad059b17962e0589e804ab611ff18d46b29 |
Close
Hashes for quadprog-0.1.2-cp27-none-macosx_10_5_x86_64.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | b915af1c9deefc084357a786d8e0ff0fab8141c04a41bb7bf85d70a2f7402c49 |
|
MD5 | da49ccc570a93bb8f8caf424781ec456 |
|
BLAKE2b-256 | eb4f10f33b59ae736521efdead78dc33e7722c3eee2ac253f4b2f4a2c91a896d |