Expressions -

⏱️ Help us benchmark CVXPY solvers! Contribute problems and results to the Solver Benchmarks project. Read our new paper on the CVXPY internals!
CVXPY represents mathematical objects as expression trees. An expression tree is a collection of mathematical expressions linked together by one or more atoms. Expression trees are encoded as instances of the Expression class, and each Leaf in a tree is a Variable, Parameter, or Constant.
A mathematical expression in a convex optimization problem.
Overloads many operators to allow for convenient creation of compound expressions (e.g., the sum of two expressions) and constraints.
The transpose of the expression.
Expression : Sum two expressions.
Expression : One expression divided by another.
Equality : Creates a constraint self == other.
Inequality : Creates an inequality constraint self <= other.
PSD : Creates a negative semidefinite inequality.
Expression : Matrix multiplication of two expressions.
Expression : The product of two expressions.
Raise expression to a power.
The power to which to raise the expression.
The expression raised to power.
Expression : Sum two expressions.
Expression : Called for Number / Expression.
PSD : Creates a negative semidefinite inequality.
Expression : Called for matrix @ Expression.
Expression : Called for Number * Expression.
PSD : Creates a positive semidefinite inequality.
PSD : Creates a positive semidefinite inequality.
Expression : The difference of two expressions.
Expression : Called for Number / Expression.
Expression : The difference of two expressions.
Expression : One expression divided by another.
The curvature of the expression.
The constraints describing the closure of the region where the expression is finite.
Gives the (sub/super)gradient of the expression w.r.t. each variable.
Matrix expressions are vectorized, so the gradient is a matrix.
A map of variable to SciPy CSC sparse matrix; None if a variable value is missing.
Is the expression affine?
Is the expression concave?
Is the expression constant?
Is the expression convex?
Checks whether the Expression is DCP.
If True, enforce the disciplined parametrized programming (DPP) ruleset; only relevant when the problem involves Parameters.
True if the Expression is DCP, False otherwise.
Checks whether the Expression is log-log DCP.
True if the Expression is log-log DCP, False otherwise.