Quadratic Programming Solver
Reason this release was yanked:
Suffers from https://github.com/quadprog/quadprog/issues/32
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.10.tar.gz
(121.6 kB
view details)
File details
Details for the file quadprog-0.1.10.tar.gz.
File metadata
- Download URL: quadprog-0.1.10.tar.gz
- Upload date:
- Size: 121.6 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 |
f13bf9609593781a5686ccfd8b38188542dc3c6e00129574817d049fb19ce966
|
|
| MD5 |
1a857961ccac0a6aabea202c317f799e
|
|
| BLAKE2b-256 |
787af0355bad3cf730747cd8971dd8b3b826a802a4f8b11648748af964b18d71
|
