Quadratic Programming Solver


License
GPL-2.0+
Install
pip install quadprog==0.1.6

Documentation

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.