\internal */

* c o n v e r t F o r t r a n T o C */

p = amd(A+A') if symmetric is true, or amd(A'A) otherwise */

breadth-first search for coarse decomposition (C0,C1,R1 or R0,R3,C3) */

allocate a cs_dmperm or cs_scc result */

add an entry to a triplet matrix; return 1 if ok, 0 otherwise */

compute the etree of A (using triu(A), or A'A without forming A'A */

solve L'x=b where x and b are dense. x=b on input, solution on output. */

[L,U,pinv]=lu(A, [q lnz unz]). lnz and unz can be guess */

C = A*B */

C = A(p,q) where p and q are permutations of 0..m-1 and 0..n-1. */

pinv = p', or p = pinv' */

post order a forest */

sparse QR factorization [V,beta,pinv,R] = qr (A) */

C = A(p,p) where A and C are symmetric the upper part stored; pinv not p */

depth-first search and postorder of a tree rooted at node j */

collect unmatched rows into the permutation vector p */

solve U'x=b where x and b are dense. x=b on input, solution on output. */

* d e l e t e G l o b a l Q P r o b l e m B I n s t a n c e */

* d e l e t e G l o b a l Q P r o b l e m B M a t r i c e s */

* d e l e t e G l o b a l Q P r o b l e m I n s t a n c e */

* d e l e t e G l o b a l Q P r o b l e m M a t r i c e s */

* d e l e t e G l o b a l S Q P r o b l e m I n s t a n c e */

* d e l e t e G l o b a l S Q P r o b l e m M a t r i c e s */

* d e t e r m i n e S t e p D i r e c t i o n */

* d e t e r m i n e S t e p D i r e c t i o n */

Enables de-allocation of internal memory. */

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

\internal * \brief Reallocates aligned memory. * Allows reallocation with aligned ptr types. This implementation will * always create a new memo

Returns dimension of vector space. */

* g e t I n d e x */

* g e t I n d e x */

* g e t I n d e x */

* g e t K K T R e s i d u a l */

* g e t M a x K K T v i o l a t i o n */

* g e t N o r m */