Skip to main content

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].


  1. D. Goldfarb and A. Idnani (1983). A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming, 27, 1-33.

Project details

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.11.tar.gz (121.6 kB view hashes)

Uploaded source

Built Distributions

quadprog-0.1.11-cp310-cp310-win_amd64.whl (80.9 kB view hashes)

Uploaded cp310

quadprog-0.1.11-cp39-cp39-win_amd64.whl (82.0 kB view hashes)

Uploaded cp39

quadprog-0.1.11-cp38-cp38-win_amd64.whl (81.9 kB view hashes)

Uploaded cp38

quadprog-0.1.11-cp37-cp37m-win_amd64.whl (80.6 kB view hashes)

Uploaded cp37

quadprog-0.1.11-cp36-cp36m-win_amd64.whl (90.6 kB view hashes)

Uploaded cp36

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page