Is the composition non-decreasing in argument idx?

Returns true if expression is not parametrized.

Is the expression a positive semidefinite matrix?

Given (A, b) in view and constant data d, return (A*d, b*d). d is broadcasted along dimension 1 (columns). When the lhs is pa

Normalize shape to 2D (d1, d2) for the C engine.

\returns the number of columns (resp. rows) of the matrix if the storage order column major (resp. row major) */

Resolve a solver argument and build a solving chain. Resolves *solver* (``None``, a string name, or a :class:`Solver` instance) to a concrete

Return unique list preserving the order. https://stackoverflow.com/a/480227

Gives the (sub/super)gradient of the atom w.r.t. each argument. Matrix expressions are vectorized, so the gradient is a matrix.

Helper to get SOC and power cone counts from problem data.

Internal function that computes the row indices corresponding to the kronecker product of two sparse tensors.

\returns an expression of the adjoint of the factored matrix * * A typical usage is to solve for the adjoint problem A' x = b: * \co

\returns the number of columns of the represented matrix. */

The dimensions of the PSD cones.

\returns the dimension in which the plane holds */

Form the internal CXVPY constraints to form the weighted geometric mean t <= x^p. t <= x[0]^p[0] * x[1]^p[1] * ... * x[n]^p[n] where x and

Concatenates operators horizontally. Parameters ---------- operator : list The operators to stack. shape : tuple The

Is the expression concave?

Is the expression Hermitian?

Is the expression a negative semidefinite matrix?

The number of PSD cones.

\returns a const pointer to the array of the starting positions of the inner vectors. * This function is aimed at interoperability with other li

Equivalent to `cp.var(self)`.

Helper function for bit packing snippet of low precision comparison. It packs the flags from 16x16 to 8x16.

Helper function for bit packing snippet of low precision comparison. It packs the flags from 32x16 to 16x16.

Verify KKT conditions for a solved problem.

Extract quadratic coefficients for block-structured quad forms. Each output element j uses input indices from block_indices[j]. Suppo

Apply SOCDim3 reduction, solve, and return inverted solution.

* Return the pointers to the beginning of each column in \ref valuePtr() */

\returns the number of columns of the matrix */

Returns a shallow copy of the object. Used to reconstruct an object tree. Parameters ---------- args : list, optiona

Wraps a constant. Parameters ---------- value : scalar, NumPy matrix, or SciPy sparse matrix. The numeric constant to wrap. s

\returns the matrix or vector obtained by evaluating this expression. * * Notice that in the case of a plain matrix or vector (not an expr

C code in some solvers uses libc buffering; if we want to capture log output from those solvers to use in tests, we must flush the libc buffe

\internal * Must be called after inserting a set of non zero entries using the low level compressed API. */

\returns a const pointer to the array of inner indices. * This function is aimed at interoperability with other libraries. * \sa valuePtr(

Is the expression imaginary?

Is the problem mixed-integer?

Is the Leaf real valued?

Is the expression smooth?

Is the expression a column or row vector?

Disambiguate duplicate Xpress column names with a "__dup<n>" suffix. Avoids a "Duplicate column names are not allowed" error on Xpress >= 9.5

\brief Returns an expression of the tridiagonal matrix T in the decomposition * * \returns expression object representing the matrix T

Pick the default solver for a problem based on its structure. Checks commercial solvers first when configured to do so, then falls back to op

\returns the number of rows of the matrix */

\returns the size of a side of the respective square matrix, i.e., the number of indices */