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

References

  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.

Files for quadprog, version 0.1.11
Filename, size File type Python version Upload date Hashes
Filename, size quadprog-0.1.11.tar.gz (121.6 kB) File type Source Python version None Upload date Hashes View

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page