The name of the solver.

int : The maximum number of dimensions of the constrained expression.

Return first power of 2 >= n. >>> next_pow2(3) 4 >>> next_pow2(8) 8 >>> next_pow2(0) 1 >>> next_pow2(1) 1

\returns the number of nonzero pivots in the LU decomposition. * Here nonzero is meant in the exact sense, not in a fuzzy sense. * So that

* Return the number of supernodes */

Convert the given PyObject to a NumPy array with the given * typecode. On success, return a valid PyArrayObject* with the * correct type. On f

Let U = the orthogonal complement of range(V). This function returns an array Q whose columns are an orthonormal basis for U. It require

Applies the linear operator to the arguments. Parameters ---------- lin_op : LinOp A linear operator. args : list The

Applies the transpose of the linear operator to the arguments. Parameters ---------- lin_op : LinOp A linear operator. value

Return a matrix whose columns are an orthonormal basis for range(V)

Combine real/imag gradients into complex gradient for backward diff. For complex param -> (real_param, imag_param), we compute: param

Split complex deltas into real/imag deltas for forward diff. For complex param -> (real_param, imag_param), we split the complex pert

Return (t,1,x) power tuple x <= t^(1/p) 1^(1-1/p) user wants the epigraph variable t

Return (x,1,t) power tuple t <= x^p 1^(1-p) user wants the epigraph variable t

Return (x,t,1) power tuple 1 <= x^(p/(p-1)) t^(-1/(p-1)) user wants the epigraph variable t

Canonicalize PowerApprox using SOC constraints via rational approximation.

Use the string representation of objects in a tuple.

The value of the objective given the solver primal value.

workaround MSVC std::list implementation

\returns the rank of the matrix of which *this is the LU decomposition. * * \note This method has to determine which pivots should be cons

Adds a solve method to the Problem class. Arguments --------- name : str The keyword for the method. func

A problem where the quad_form term is used multiple times.

Recursively replace zero-sized expressions with zero constants.

Reshape parametric constant data from column format to matrix format, with deduplication of broadcast entries. This function is used whe

Forwards the resizing request to the nested expression * \sa DenseBase::resize(Index) */

For each i, enforce a constraint that (X[i, :], y[i], z[i]) belongs to the rotated quadratic cone { (x, y, z) : || x ||^2 <=

* Return the location in \em rowvaluePtr() which starts each column */

* Number of rows */

\returns the number of rows */

Replace square brackets with parentheses for HiGHS LP file compatibility. HiGHS does not allow square brackets in column names in LP files becaus

Scale all values by a constant.

Solve "Example 8.3" from Convex Optimization by Boyd & Vandenberghe. Verify (1) optimal objective values, (2) that the dual variable to the

Select 'rows' from tensor. If there are multiple parameters 'p', we must select the same 'rows' from each parameter slice. This is do

Sets this matrix to be the identity matrix of the current size. */