\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.conj(self)`.

Format atom with labels, mirroring name() where safe. - If this atom or any ancestor has set a label, return it. - If the subclass di

Is the expression nonnegative?

Equivalent to `cp.min(self, axis, keepdims)`.

\returns a read-only view of the stored coefficients as a 1D array expression. * * \warning this method is for \b compressed \b storage \b

Converts a non-Expression to a Constant.

Return a TensorView that has shape information, but no data.

Factory function for infeasible or unbounded solutions. Parameters ---------- status : str The problem status. attr : dict

Is the Leaf hermitian?

Returns the bounds on the expression. Indicator is 0 if constraints hold, +inf otherwise.

Depth-first parsing of a linOp node. Parameters ---------- lin_op: a node in the linOp tree. empty_view: Ten

Set a custom label for this constraint. This method exists alongside the property setter (con.label = "name") to enable method chaini

Solve a feasibility problem and return the value of expr via y == expr.

Applies the chain to a problem and returns an equivalent problem. Parameters ---------- problem : Problem The pro

Is the expression positive?

Is the Leaf symmetric?

Expression : Matrix multiplication of two expressions.

Asserts that expr is an Expression with dimension shape.

Is the expression nonpositive?

Is the expression a scalar?

\returns a const pointer to the array of values. * This function is aimed at interoperability with other libraries. * \sa innerIndexPtr(),

Accessor method for variables. Returns ------- list of :class:`~cvxpy.expressions.variable.Variable` A list of th

Convert float to bfloat16 according to round-to-nearest-even/denormals algorithm.

Returns the variables in the problem.

Broadcast view to a new shape.

Returns a single slice of the tensor for a given parameter offset.

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

This is equivalent to make_half2, which is undocumented and doesn't seem to always exist.

Is the expression convex?

Does the problem satisfy DPP rules? DPP is a mild restriction of DGP. When a problem involving Parameters is DPP, subsequent solves c

Equivalent to `cp.cumsum(self, axis)`.

Issue a warning that appears to originate from user code. Walks up the call stack from the caller until a frame outside the cvxpy package (or

A problem is accepted if the sequence of reductions is valid. In particular, the i-th reduction must accept the output of the i-1th r

Returns bounds (lower, upper) of the expression. Combines bounds_from_args() with sign information for potentially tighter bounds. R

Returns info needed to reconstruct the expression besides the args.

Turns the matrix into the \em compressed format. */

Convert to COO format (stacked) for compatibility.