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

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

Total number of variables............................:   100000
                     variables with only lower bounds:   100000
                variables with lower and upper bounds:        0
                     variables with only upper bounds:        0
Total number of equality constraints.................:        0
Total number of inequality constraints...............:        1
        inequality constraints with only lower bounds:        0
   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  5.8332333e+04 5.00e+04 2.00e+00 5.00e-01  -1.0     -   0.00e+00  0  0 
   1r 5.8332317e+04 0.00e+00 9.99e+02 5.00e+04   4.7     -   2.00e-07  1 10R
   2r 5.8332333e+04 3.11e-10 3.13e+00 1.57e+02   3.3     -   1.50e-11  1  2f
   3  3.3335823e+04 4.99e+02 3.67e-01 6.60e-02  -1.0     -   3.27e-02  2  1f
   4  3.3332655e+04 5.02e+00 1.53e-02 8.40e-03  -1.0     -   9.90e-01  1  1h
   5  3.3334221e+04 4.02e-01 4.47e+00 3.72e-03  -1.0     -   9.20e-01  2  1h
   6  3.3333397e+04 2.84e-01 4.80e+01 1.35e-03  -1.0     -   2.95e-01  2  2f
   7  3.3333320e+04 1.07e-09 1.03e-08 1.03e-03  -1.0     -   1.00e+00  2  1h
   8  3.3333320e+04 3.51e-06 1.79e+00 3.94e-05  -5.7     -   1.00e+00  1  1f
   9  3.3332044e+04 4.58e-10 5.27e-01 2.00e-05  -5.7     -   1.00e+00  1  1f
iter    objective    inf_pr   inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls
  10  3.3331535e+04 1.88e-10 1.53e-02 1.78e-05  -5.7     -   1.00e+00  1  1f
  11  3.3331524e+04 2.86e-12 1.01e-03 3.99e-06  -5.7     -   1.00e+00  1  1f
  12  3.3331523e+04 2.19e-13 1.84e-11 2.22e-06  -5.7     -   1.00e+00  1  1f
  13  3.3331341e+04 2.55e-13 1.34e-03 7.15e-07  -8.6     -   1.00e+00  1  1f
  14  3.3331340e+04 1.55e-14 2.55e-04 2.20e-07  -8.6     -   1.00e+00  1  1f
  15  3.3331340e+04 3.80e-15 2.79e-05 5.90e-08  -8.6     -   1.00e+00  1  1f
  16  3.3331340e+04 1.50e-15 2.53e-14 1.57e-08  -8.6     -   1.00e+00  1  1f
  17  3.3331340e+04 1.48e-16 9.99e-15 4.34e-09  -9.0     -   1.00e+00  1  1f

Number of Iterations....: 17

                                   (scaled)                 (unscaled)
Objective...............:   3.3331339856020139e+04    3.3331339856020139e+04
Dual infeasibility......:   9.9920072216264089e-15    9.9920072216264089e-15
Constraint violation....:   1.4840015085225749e-16    1.4840015085225749e-16
Complementarity.........:   4.3393956807166849e-09    4.3393956807166849e-09
Overall NLP error.......:   4.3393956807166849e-09    4.3393956807166849e-09

Number of objective function evaluations              = 28
Number of objective gradient evaluations              = 18
Number of constraint evaluations                      = 29
Number of constraint Jacobian evaluations             = 19
Number of Lagrangian Hessian evaluations              = 17
Number of KKT factorizations                          = 18
Number of KKT backsolves                              = 22

Total wall secs in initialization                     =  0.261 s
Total wall secs in linear solver                      =  0.078 s
Total wall secs in NLP function evaluations           =  0.006 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.062 s
Total wall secs                                       =  0.407 s

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