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

Number of nonzeros in constraint Jacobian............:       16
Number of nonzeros in Lagrangian Hessian.............:       10

Total number of variables............................:        4
                     variables with only lower bounds:        4
                variables with lower and upper bounds:        0
                     variables with only upper bounds:        0
Total number of equality constraints.................:        0
Total number of inequality constraints...............:        3
        inequality constraints with only lower bounds:        2
   inequality constraints with lower and upper bounds:        1
        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.3080000e+02 3.00e+00 3.95e+01 8.92e+01  -1.0     -   0.00e+00  0  0 
   1  1.3079999e+02 3.00e+00 2.43e-03 1.97e-03  -1.0     -   1.00e-07  1  2h
   2  3.5163625e+01 2.39e-02 3.50e-06 1.90e-04  -1.0     -   1.00e+00  5  1h
   3  3.0862139e+01 1.71e-02 2.30e-04 5.61e-05  -3.8     -   1.00e+00  2  1h
   4  2.9902492e+01 1.11e-02 2.61e-05 9.51e-06  -3.8     -   9.97e-01  6  1h
   5  2.9894260e+01 1.10e-03 2.87e-04 3.79e-05  -3.8     -   9.33e-01  3  1h
   6  2.9894384e+01 1.09e-09 4.44e-08 2.37e-06  -5.7     -   1.00e+00  1  1h
   7  2.9894378e+01 7.89e-12 7.58e-07 1.74e-07  -8.6     -   1.00e+00  1  1h
   8  2.9894378e+01 1.35e-15 1.92e-13 4.77e-09  -8.6     -   1.00e+00  1  1h

Number of Iterations....: 8

                                   (scaled)                 (unscaled)
Objective...............:   2.9894377970961543e+01    2.9894377970961543e+01
Dual infeasibility......:   1.9184653865522705e-13    1.9184653865522705e-13
Constraint violation....:   1.3499774738207196e-15    1.3499774738207196e-15
Complementarity.........:   4.7681630877907736e-09    4.7681630877907736e-09
Overall NLP error.......:   4.7681630877907736e-09    4.7681630877907736e-09

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

Total wall secs in initialization                     =  0.025 s
Total wall secs in linear solver                      =  0.012 s
Total wall secs in NLP function evaluations           =  0.002 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.019 s
Total wall secs                                       =  0.058 s

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