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.5.tar.gz
(105.8 kB
view details)
File details
Details for the file quadprog-0.1.5.tar.gz.
File metadata
- Download URL: quadprog-0.1.5.tar.gz
- Upload date:
- Size: 105.8 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
f783a61be0f7fc8a35c8d003ad8f5543c588bf9b95fb9267876fca01519ff585
|
|
| MD5 |
6ea872a4ca827224fc6cf889cc6ab39a
|
|
| BLAKE2b-256 |
0b884c140575a0da2d13d834b682017ba2fb074f652204d1339abd3e62a6ac18
|
