quadprog

Quadratic Programming Solver

Showing:

Popularity

Downloads/wk

0

GitHub Stars

107

Maintenance

Last Commit

19d ago

Contributors

8

Package

Dependencies

0

License

GPLv2+

Categories

Readme

quadprog: Quadratic Programming Solver (Python)

.github/workflows/build-and-test.yaml

Solve a strictly convex quadratic program

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
---------
... [1] D. Goldfarb and A. Idnani (1983). A numerically stable dual
    method for solving strictly convex quadratic programs.
    Mathematical Programming, 27, 1-33.

Installation

pip install quadprog

Dependencies

  • Runtime
    • numpy
  • Installation
    • numpy, C compiler.

Developing

See docs/DEVELOP.md.

Rate & Review

Great Documentation0
Easy to Use0
Performant0
Highly Customizable0
Bleeding Edge0
Responsive Maintainers0
Poor Documentation0
Hard to Use0
Slow0
Buggy0
Abandoned0
Unwelcoming Community0
100
No reviews found
Be the first to rate

Alternatives

No alternatives found

Tutorials

No tutorials found
Add a tutorial