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.4.tar.gz
(100.2 kB
view details)
File details
Details for the file quadprog-0.1.4.tar.gz.
File metadata
- Download URL: quadprog-0.1.4.tar.gz
- Upload date:
- Size: 100.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | eacaff42b5f6afb91c8a4376a546dc6aebd3a2023d157e832bb64446008ce0c0 |
|
| MD5 | f62b07779a0386817c4eb355827f0d50 |
|
| BLAKE2b-256 | 3c506fa5c3add4a202a4e011688efb48a5adbc636cdcf030ba652970438745e9 |
