Skip to main content
Donate to the Python Software Foundation or Purchase a PyCharm License to Benefit the PSF! Donate Now

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, solver=X) with a solver keyword argument to select the backend solver. The quadratic program it solves is, in standard form:

https://raw.githubusercontent.com/stephane-caron/qpsolvers/master/.qp.png

where vector inequalities are taken coordinate by coordinate.

Solvers

The list of supported solvers currently includes:

Example

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.

Filename, size & hash SHA256 hash help File type Python version Upload date
qpsolvers-1.0.5.tar.gz (8.8 kB) Copy SHA256 hash SHA256 Source None

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN SignalFx SignalFx Supporter DigiCert DigiCert EV certificate StatusPage StatusPage Status page