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.6.tar.gz
(107.5 kB
view details)
File details
Details for the file quadprog-0.1.6.tar.gz.
File metadata
- Download URL: quadprog-0.1.6.tar.gz
- Upload date:
- Size: 107.5 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
5e161635fb7f2730edef0070448bdbe93784552202c12e15e0fbf640f0cef0f4
|
|
| MD5 |
de1b6322ef22ad917a5d6042e7e2c3c4
|
|
| BLAKE2b-256 |
24fb816f87f1b9648231b51012758b1d8fa3043ee1a428e3dbb64c6e6a42b6b9
|
