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 details)
File details
Details for the file quadprog-0.1.0.tar.gz.
File metadata
- Download URL: quadprog-0.1.0.tar.gz
- Upload date:
- Size: 98.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
541369148bc1ccf022134c4da2ef7c12a168c89303f39282fa0410ee4537a87d
|
|
| MD5 |
be3fa8a188f7248dacce33fcd5bfcb6c
|
|
| BLAKE2b-256 |
8ad5cf0896e0f52a8682aadc532fb792b00cdf25e11d99954fa99026b4d3d112
|
