Returns tensor of a variable node, i.e., eye(n) across axes 0 and 1, where n is the size of the variable.

Returns the lower triangular Hessian values in COO format.

Returns the COO sparsity structure of the lower part of the Hessian. The returned rows are ascending, and within each row the columns are

\returns Success if the iterations converged, and NoConvergence otherwise. */

Must be call first when calling Eigen from multiple threads */

\returns a const pointer to the array of the number of non zeros of the inner vectors. * This function is aimed at interoperability with other l

\returns whether \c *this is in compressed form. */

Is the atom concave?

Is the atom convex?

An exponential constraint is DCP if each argument is affine.

An exponential constraint is DCP if each argument is affine.

An operator relative conic constraint is DCP when (A, b, C) is affine

The objective must be convex.

Test if a vector is a valid dyadic weight vector. w must be nonnegative, sum to 1, and have integer or dyadic fractional elements.

Is the expression a Hermitian matrix?

Is the Leaf imaginary?

Check if KNITRO is installed and a license is available. Detection is intentionally based on environment variables rather than importing ``kn

Is the expression concave after linearizing all smooth subexpressions?

Check if MOSEK is installed and a license is available.

Returns the Jacobian values in COO format at the sparsity structure.

Returns the sparsity structure of the Jacobian.

Returns view corresponding to Kronecker product of view x with data 'a', i.e., kron(x,a). Note: kron_l currently doesn't support par

Returns view corresponding to Kronecker product of data 'a' with view x, i.e., kron(a,x). Note: kron_r currently doesn't support par

\internal return the index of the coeff at (row,col) or just before if it does not exist. * This is an analogue of std::lower_bound. */

\internal \returns b if a<=0, and returns a otherwise. */

\internal */

\brief Constructs the Hessenberg matrix H in the decomposition * * \returns expression object representing the matrix H * * \p

\brief Returns the unitary matrix Q in the decomposition * * \returns object representing the matrix Q * * \pre Either the con

The name of the variable.

The name of the solver.

The name of the solver.

The name of the solver.

The name of solver.

\returns the max number of threads reserved for Eigen * \sa setNbThreads */

Given (A, b) in view, return (-A, -b).

Normalize an axis argument to a canonical form. - Negative indices become positive. - Single-element tuples become an int. - If all axes

The number of elementwise cones.

The number of elementwise cones.

The number of elementwise cones.

The number of elementwise cones.

Given a PyObject pointer, cast it to a PyArrayObject pointer if * legal. If not, set the python error string appropriately and * return NULL.

Parse a tag like v1.8.0 into (major, minor, micro).

A modification of pcp_2. Reformulate max (x**0.2)*(y**0.8) + z**0.4 - x s.t. x + y + z/2 == 2 x, y

A power cone formulation of a Fisher market equilibrium pricing model. ceei = Competitive Equilibrium from Equal Incomes

Generate strictly positive inputs (for log, sqrt, etc.).

\internal * Queries and returns the cache sizes in Bytes of the L1, L2, and L3 data caches respectively */

Test whether a python object is contiguous. If array is * contiguous, return 1. Otherwise, set the python error string and * return 0. */

Require that a numpy array is not byte-swapped. If the array is * not byte-swapped, return 1. Otherwise, set the python error string * and ret

dummy resize function

Multiply view with constant data from the right. When the rhs is parametrized, multiply each slice of the tensor with the sin

\returns the number of rows. \sa cols() */

\returns the number of columns */

Save the value of the dual variable for the constraint's parent. Args: value: The value of the dual variable.

Removes all non zeros but keep allocated memory * * This function does not free the currently allocated memory. To release as much as memo