This is MadNLP version v0.12.0, running with cuDSS v1.0.0

Number of nonzeros in constraint Jacobian............:        0
Number of nonzeros in Lagrangian Hessian.............:      256

Total number of variables............................:       31
                     variables with only lower bounds:        0
                variables with lower and upper bounds:        0
                     variables with only upper bounds:        0
Total number of equality constraints.................:        0
Total number of inequality constraints...............:        0
        inequality constraints with only lower bounds:        0
   inequality constraints with lower and upper bounds:        0
        inequality constraints with only upper bounds:        0

iter    objective    inf_pr   inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls
   0  1.0431048e+00 0.00e+00 1.00e+02 0.00e+00  -1.0     -   0.00e+00  0  0 
   1  1.2663820e-03 0.00e+00 1.31e+00 0.00e+00  -1.0   -2.0  1.00e+00  1  1f
   2  3.8577852e-05 0.00e+00 1.17e-02 0.00e+00  -1.0   -2.5  1.00e+00  1  1f
   3  3.5800869e-05 0.00e+00 3.52e-01 0.00e+00  -3.8     -   1.00e+00  1  1f
   4  4.1295702e-07 0.00e+00 1.66e-05 0.00e+00  -3.8   -3.0  1.00e+00  1  1f
   5  4.9789605e-08 0.00e+00 1.70e-02 0.00e+00  -8.6     -   1.00e+00  1  1f
   6  2.4593104e-13 0.00e+00 1.42e-07 0.00e+00  -8.6     -   1.00e+00  1  1f
   7  3.0048140e-20 0.00e+00 1.25e-08 0.00e+00  -8.6     -   1.00e+00  1  1f
   8  1.5764680e-25 0.00e+00 3.49e-11 0.00e+00  -9.0     -   1.00e+00  1  1f

Number of Iterations....: 8

                                   (scaled)                 (unscaled)
Objective...............:   2.9953095140537407e-26    1.5764679528879518e-25
Dual infeasibility......:   3.4930402811608694e-11    1.8384297300696361e-10
Constraint violation....:   0.0000000000000000e+00    0.0000000000000000e+00
Complementarity.........:   0.0000000000000000e+00    0.0000000000000000e+00
Overall NLP error.......:   6.6368217431678741e-12    3.4930402811608694e-11

Number of objective function evaluations              = 9
Number of objective gradient evaluations              = 9
Number of constraint evaluations                      = 9
Number of constraint Jacobian evaluations             = 9
Number of Lagrangian Hessian evaluations              = 8
Number of KKT factorizations                          = 12
Number of KKT backsolves                              = 8

Total wall secs in initialization                     =  0.013 s
Total wall secs in linear solver                      =  0.004 s
Total wall secs in NLP function evaluations           =  0.006 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.004 s
Total wall secs                                       =  0.026 s

EXIT: Optimal Solution Found (tol = 1.0e-08).