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.
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.3.tar.gz
(97.6 kB
view details)
File details
Details for the file quadprog-0.1.3.tar.gz.
File metadata
- Download URL: quadprog-0.1.3.tar.gz
- Upload date:
- Size: 97.6 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
e2666c86441a5c4fb43f271165d2b70d6ed2a50652b814ff3bf4bb4948c78d73
|
|
| MD5 |
5202dbb765a0e0fa4194fb19cf6f5932
|
|
| BLAKE2b-256 |
ad77b6c4cd0257897649ccf4964b7c6dd6aa26aedeb01f55882e32ed97c08b9f
|
