Skip to content
Quadratic Programming Solver
Branch: master
Clone or download
rmcgibbo Merge pull request #1 from BlonkConsultants/master
modifications to to avoid importerror 'module Cython does not exist'
Latest commit 938b20b Sep 11, 2018
Type Name Latest commit message Commit time
Failed to load latest commit information.
quadprog Add f2c'd files Oct 11, 2015
.gitignore add files Sep 18, 2015
.travis.yml simplify test Oct 11, 2015
LICENSE Fix manifest Oct 12, 2015 Update Oct 11, 2015 Update Jan 23, 2018


Build Status

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].

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


pip install quadprog


  • Runtime
    • numpy
  • Build time
    • numpy, cython, C++ compiler.
You can’t perform that action at this time.