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.9.tar.gz
(131.7 kB
view details)
File details
Details for the file quadprog-0.1.9.tar.gz.
File metadata
- Download URL: quadprog-0.1.9.tar.gz
- Upload date:
- Size: 131.7 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/3.4.2 importlib_metadata/4.8.1 pkginfo/1.7.1 requests/2.26.0 requests-toolbelt/0.9.1 tqdm/4.62.3 CPython/3.8.5
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
446a4c0554466df477896c675a25b838950f1550412f247fe354fbbd8200c3cc
|
|
| MD5 |
ef9e10a5c2e2acfe6d64ad42e5919bde
|
|
| BLAKE2b-256 |
8a2634c204815f655f3bd43b9eb23c1b5cebea71166a4f043780246801556893
|