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

Number of nonzeros in constraint Jacobian............:        2
Number of nonzeros in Lagrangian Hessian.............:        2

Total number of variables............................:        2
                     variables with only lower bounds:        0
                variables with lower and upper bounds:        2
                     variables with only upper bounds:        0
Total number of equality constraints.................:        0
Total number of inequality constraints...............:        1
        inequality constraints with only lower bounds:        1
   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 -9.8959196e+01 0.00e+00 2.00e+00 5.10e+01  -1.0     -   0.00e+00  0  0 
   1 -9.9954521e+01 0.00e+00 2.82e-02 2.45e+00  -1.0     -   1.00e+00  1  1f
   2 -9.9819427e+01 0.00e+00 4.20e-01 1.56e+00  -1.0     -   1.00e+00  1  1f
   3 -9.9827376e+01 2.88e-13 1.73e-17 1.17e-01  -1.0     -   1.00e+00  1  1f
   4 -9.9927945e+01 3.55e-15 8.43e-05 2.63e-02  -2.5     -   1.00e+00  1  1f
   5 -9.9957614e+01 1.78e-15 2.60e-18 6.16e-03  -3.8     -   1.00e+00  1  1f
   6 -9.9960000e+01 3.55e-15 1.74e-04 4.80e-04  -3.8     -   9.58e-01  1  1f
   7 -9.9959998e+01 3.55e-15 3.39e-17 1.86e-06  -5.7     -   1.00e+00  1  1f
   8 -9.9960000e+01 3.55e-15 2.69e-18 2.59e-09  -8.6     -   1.00e+00  1  1f

Number of Iterations....: 8

                                   (scaled)                 (unscaled)
Objective...............:  -9.9959999998333970e+01   -9.9959999998333970e+01
Dual infeasibility......:   2.6929824371174377e-18    2.6929824371174377e-18
Constraint violation....:   3.5527136788005009e-15    3.5527136788005009e-15
Complementarity.........:   2.5909331097276411e-09    2.5909331097276411e-09
Overall NLP error.......:   2.5909331097276411e-09    2.5909331097276411e-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.014 s
Total wall secs in linear solver                      =  0.004 s
Total wall secs in NLP function evaluations           =  0.002 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.012 s
Total wall secs                                       =  0.032 s

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