Welcome to CVXPY 1.0

Convex optimization, for everyone.

For the best support, join the CVXPY mailing list and post your questions on Stack Overflow.

CVXPY is a Python-embedded modeling language for convex optimization problems. It allows you to express your problem in a natural way that follows the math, rather than in the restrictive standard form required by solvers.

For example, the following code solves a least-squares problem with box constraints:

import cvxpy as cp
import numpy as np

# Problem data.
m = 30
n = 20
A = np.random.randn(m, n)
b = np.random.randn(m)

# Construct the problem.
x = cp.Variable(n)
objective = cp.Minimize(cp.sum_squares(A*x - b))
constraints = [0 <= x, x <= 1]
prob = cp.Problem(objective, constraints)

# The optimal objective value is returned by `prob.solve()`.
result = prob.solve()
# The optimal value for x is stored in `x.value`.
# The optimal Lagrange multiplier for a constraint is stored in
# `constraint.dual_value`.

This short script is a basic example of what CVXPY can do; in addition to convex programming, CVXPY also supports a generalization of geometric programming.

For a guided tour of CVXPY, check out the tutorial. Browse the library of examples for applications to machine learning, control, finance, and more.


  • CVXPY v1.1.a1 (which is an alpha version) has been released. This version makes repeatedly canonicalizing parametrized problems much faster than before. See the tutorial on Disciplined Parametrized Programming for more information.

  • CVXPY v1.0.24 supports disciplined quasiconvex programming, which lets you formulate and solve quasiconvex programs. See the tutorial for more information.

  • CVXPY v1.0.11 supports disciplined geometric programming, which lets you formulate geometric programs and log-log convex programs. See the tutorial for more information.

  • CVXPY 1.0 brings the API closer to NumPy and the architecture closer to software compilers, making it easy for developers to write custom problem transformations and target custom solvers. CVXPY 1.0 is not backwards compatible with previous versions of CVXPY. For more details, see What’s New in 1.0.


CVXPY relies on the open source solvers ECOS, OSQP, and SCS. Additional solvers are supported, but must be installed separately. For background on convex optimization, see the book Convex Optimization by Boyd and Vandenberghe.


CVXPY began as a Stanford University research project. Today, CVXPY is a community project, built from the contributions of many researchers and engineers.

CVXPY is developed and maintained by Steven Diamond and Akshay Agrawal, with many others contributing significantly. A non-exhaustive list of people who have shaped CVXPY over the years includes Stephen Boyd, Eric Chu, Robin Verschueren, Bartolomeo Stellato, Riley Murray, Jaehyun Park, Enzo Busseti, AJ Friend, Judson Wilson, and Chris Dembia.

We appreciate all contributions. To get involved, see our contributing guide.