Skip to main content

Quadratic Programming solvers for Python with a unified API

Project description

This module provides a single function solve_qp(P, q, G, h, A, b, lb, ub, solver=X) with a solver keyword argument to select the backend solver. The quadratic program it solves is, in standard form:

where vector inequalities are taken coordinate by coordinate.


The list of supported solvers currently includes:


To solve a quadratic program, simply build the matrices that define it and call the solve_qp function:

from numpy import array, dot
from qpsolvers import solve_qp

M = array([[1., 2., 0.], [-8., 3., 2.], [0., 1., 1.]])
P = dot(M.T, M)  # quick way to build a symmetric matrix
q = dot(array([3., 2., 3.]), M).reshape((3,))
G = array([[1., 2., 1.], [2., 0., 1.], [-1., 2., -1.]])
h = array([3., 2., -2.]).reshape((3,))
A = array([1., 1., 1.])
b = array([1.])

print "QP solution:", solve_qp(P, q, G, h, A, b)

This example outputs the solution [0.30769231, -0.69230769,  1.38461538].

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Files for qpsolvers, version 1.3
Filename, size File type Python version Upload date Hashes
Filename, size qpsolvers-1.3.tar.gz (10.1 kB) File type Source Python version None Upload date Hashes View

Supported by

Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page