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.............:     1659

Total number of variables............................:        9
                     variables with only lower bounds:        1
                variables with lower and upper bounds:        8
                     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  4.1877858e+04 0.00e+00 1.01e+02 7.00e+00  -1.0     -   0.00e+00  0  0 
   1  2.5821052e+04 0.00e+00 8.57e-04 8.00e-05  -1.0     -   1.00e+00  1  1f
   2  2.0252464e+04 0.00e+00 7.23e-04 7.99e-05  -5.7     -   1.00e+00  1  1f
   3  1.8564687e+04 0.00e+00 1.11e-03 8.92e-05  -5.7     -   1.00e+00  1  1f
   4  1.8247309e+04 0.00e+00 2.31e-03 1.42e-04  -5.7     -   1.00e+00  1  1f
   5  1.8236206e+04 0.00e+00 8.87e-03 2.33e-04  -5.7     -   1.00e+00  1  1f
   6  1.8236182e+04 0.00e+00 7.35e-05 2.17e-06  -5.7     -   1.00e+00  1  1f
   7  1.8236182e+04 0.00e+00 4.34e-10 1.84e-06  -5.7     -   1.00e+00  1  1f
   8  1.8236182e+04 0.00e+00 5.00e-12 2.67e-09  -8.6     -   1.00e+00  1  1f

Number of Iterations....: 8

                                   (scaled)                 (unscaled)
Objective...............:   4.1092463161012001e+00    1.8236181748352123e+04
Dual infeasibility......:   5.0028028940898411e-12    2.2201643758937307e-08
Constraint violation....:   0.0000000000000000e+00    0.0000000000000000e+00
Complementarity.........:   6.0144383472794874e-13    2.6691121042194090e-09
Overall NLP error.......:   2.6691121042194090e-09    2.6691121042194090e-09

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                          = 8
Number of KKT backsolves                              = 8

Total wall secs in initialization                     =  0.012 s
Total wall secs in linear solver                      =  0.004 s
Total wall secs in NLP function evaluations           =  0.010 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.016 s
Total wall secs                                       =  0.041 s

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