|
CDIMSJ − CUTEr tool to determine number of nonzeros to store the matrix of gradients of the objective function and constraints, in sparse format. |
|
CALL CDIMSJ( NNZJ ) |
|
The CDIMSJ subroutine determines the number of nonzero elements required to store the matrix of gradients of the objective function and constraint functions for the problem decoded into OUTSDIF.d in the constrained minimization case. The matrix is stored in sparse format. |
|
The arguments of CDIMSJ are as follows |
|
NNZJ [out] - integer |
|
the number of nonzero elements in the matrix. |
|
I. Bongartz, A.R. Conn, N.I.M. Gould, D. Orban and Ph.L. Toint |
|
CUTEr (and SifDec): A Constrained and Unconstrained Testing Environment, revisited, N.I.M. Gould, D. Orban and Ph.L. Toint, ACM TOMS, 29:4, pp.373-394, 2003. CUTE: Constrained and Unconstrained Testing Environment, I. Bongartz, A.R. Conn, N.I.M. Gould and Ph.L. Toint, TOMS, 21:1, pp.123-160, 1995. |