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.
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.1.tar.gz
(98.8 kB
view details)
File details
Details for the file quadprog-0.1.1.tar.gz.
File metadata
- Download URL: quadprog-0.1.1.tar.gz
- Upload date:
- Size: 98.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
75e8e0d6c7900a38370c333198aaa28d7b760c3979f150ec0202972caa7e7bc4
|
|
| MD5 |
7334bd44b537e650eba0b40a7a1e423a
|
|
| BLAKE2b-256 |
6ed01613888e23fb1074df32b42d3b235489b14700d4f6cd91c34867fac5ad41
|
