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.
Project details
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.8.tar.gz
(269.1 kB
view details)
File details
Details for the file quadprog-0.1.8.tar.gz
.
File metadata
- Download URL: quadprog-0.1.8.tar.gz
- Upload date:
- Size: 269.1 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.2.0 pkginfo/1.5.0.1 requests/2.24.0 setuptools/47.3.1.post20200906 requests-toolbelt/0.9.1 tqdm/4.48.2 CPython/3.8.5
File hashes
Algorithm | Hash digest | |
---|---|---|
SHA256 | 3dedf9366929d87828584037a1228e03fbf9e72cc8cbb203683aede5c3350b07 |
|
MD5 | e2c9f57942513d323750a2e26bad49cf |
|
BLAKE2b-256 | 31c7833d7b5b53fff5b9042803aa8096207d8e038ca42052f074d4ad8cddbfc5 |