The optimization variables in a problem. Attributes ---------- sample_bounds : tuple[np.ndarray, np.ndarray] | None Explicit boun

A convex optimization problem. Problems are immutable, save for modification through the specification of :class:`~cvxpy.expressions.constant

A constant value. Raw numerical constants such as Python primitive types or NumPy ndarrays are implicitly cast to constants via Expressi

A utility class to verify derivative computations by comparing C-based diff engine results against Python-based evaluations.

An optimization objective for minimization. Parameters ---------- expr : Expression The expression to minimize. Must be a scalar.

Helper class that allows to access properties of linOps without needing to create a full linOps instance

Parameters in optimization problems. Parameters are constant expressions whose value may be specified after problem creation. The only way to

Configuration for testing a single atom.

A solution to an optimization problem. Attributes ---------- status : str The status code. opt_val : float The optima

Parses strings of the form 'x.y.z+[STUFF]' and tuples of the form (x, y, z). In the former case, '+[STUFF]' refers to a local version identif

Reshapes the expression. Vectorizes the expression then unvectorizes it into the new shape. The entries are reshaped and stored in colum

Construct matrices for linear cone problems. Linear cone problems are assumed to have a linear objective and cone constraints which may have

A second-order cone constraint for each row/column. Assumes ``t`` is a vector the same length as ``X``'s columns (rows) for ``axis == 0`` (``

Compact representation of a parameter-indexed sparse tensor. Represents the 3D tensor T[param_idx, row, col] in COO format. For a tenso

:math:`\\max_{i,j}\\{X_{i,j}\\}`.

Logical AND of boolean expressions. Returns 1 if and only if all arguments equal 1, and 0 otherwise. For two operands, can also be written w

Constrain each entry of an Expression to take a value in a given set of real numbers. Parameters ---------- expre : Expression

---------- float ----------

Analyzes a CVXPY Problem to determine its structural properties. Attributes like quadratic objectives, required cones, integer constraints, a

A constraint of the form :math:`x = 0`. The preferred way of creating a ``Zero`` constraint is through operator overloading. To constrain an

Logical NOT of a boolean expression. Returns ``1 - x``, i.e., flips 0 to 1 and 1 to 0. Can also be written with the ``~`` operator: ``~x``.

Logical OR of boolean expressions. Returns 1 if and only if at least one argument equals 1, and 0 otherwise. For two operands, can also be w

Logical XOR of boolean expressions. For two arguments: result is 1 iff exactly one is 1. For n arguments: result is 1 iff an odd number are 1

---------- double ----------

---------- float ----------

A reformulated exponential cone constraint. Operates elementwise on :math:`x, y, z`. Original cone: .. math:: K = \\{(x,y,z) \

---------- double ----------

An object representing a collection of 3D power cone constraints x[i]**alpha[i] * y[i]**(1-alpha[i]) >= |z[i]| for all i x >= 0

---------- float ----------

---------- float ----------

A constraint of the form :math:`\\frac{1}{2}(X + X^T) \\succcurlyeq_{S_n^+} 0` Applying a ``PSD`` constraint to a two-dimensional expression ``X`

Error thrown when a solver encounters an error solving a problem.

:math:`\\min{i,j}\\{X_{i,j}\\}`.

Reduce DCP problems to a conic form. This reduction takes as input (minimization) DCP problems and converts them into problems with affine or

Elementwise absolute value. Computes the elementwise absolute value of the input. Mathematical definition: .. math:: f(

A constraint of the form :math:`x \\geq 0`. The preferred way of creating an inequality constraint is through operator overloading. To constr

Flip a minimization objective to a maximization and vice versa.

---------- double ----------

---------- float ----------

An optimization objective for maximization. Parameters ---------- expr : Expression The expression to maximize. Must be a scalar.

The vectorized strictly upper-triangular entries. The vectorization is performed by concatenating (partial) rows. For example, if :

Expand convex variable attributes into constraints.

Represents a collection of N-dimensional power cone constraints that is *mathematically* equivalent to the following code snippet (which

Configuration for testing atoms with multiple variable arguments.

Symbolic form of QuadForm when quadratic matrix is not known (yet). Parameters ---------- x : Variable or Expression The inp

Elementwise natural logarithm. Computes the elementwise natural logarithm of the input. Mathematical definition: .. math::

Multiplies two expressions elementwise.

Stores data useful for solution retrieval.

Sparse representation of a 3D Tensor. Semantically similar to COO format, with one extra dimension. Here, 'row' is axis 0, 'col' axis 1, and

Oracle interface for NLP solvers using the C-based diff engine. Provides function and derivative oracles (objective, gradient, constraints, J

Elementwise exponential function. Computes the elementwise exponential of the input. Mathematical definition: .. math::

Asserts that a square matrix is PSD.

The context for a reduction, which may include a solver and solver options.

:math:`\\log\\sum_i e^{x_i}`

Asserts that X is a real square matrix, satisfying X + X.T == 0.

An interface for the Clarabel solver.

A logical grouping of multiple reductions into a single reduction. Attributes ---------- reductions : list[Reduction] A list of r

Error thrown for DCP violations.

Eliminates zero-sized expressions from a problem. Zero-sized variables (those with a 0 in their shape) have no elements and are vacuous. This

Asserts that a real square matrix is symmetric

Transpose an expression. For an n-D expression, if axes are given, the order indicates the permutation of axes.

Represents the von Neumann Entropy of the positive-definite matrix :math:`X,` .. math:: -\\operatorname{tr}(X \\log X).

QP interface for the OSQP solver

An interface for the SCS solver.

Asserts that a square matrix is Hermitian.

Kronecker product.

Convert n-dimensional SOC constraints to dimension-3 SOC constraints.

A reduction chain that ends with a solver. Parameters ---------- reductions : list[Reduction] A list of reductions. The last redu

A PSD constraint in scaled vectorized (svec) form. The argument is a 1-D expression of length ``n * (n + 1) // 2`` representing the scaled lo

Test-only Clarabel wrapper exposing only SvecPSD (no SOC).

Converts a vector into a diagonal matrix.

Elementwise maximum of a sequence of expressions. Computes the elementwise maximum over two or more input expressions. Mathematical definiti

r"""Implements the perspective transform of a convex or concave scalar expression. Uses the fact that given a cone form for the epigraph of :math:

Extracts variable and constraint bounds from a CVXPY problem. Converts the problem into the standard NLP form:: g^l <= g(x) <= g^u, x^