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

Total number of variables............................:     3000
                     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  2.0021547e+04 0.00e+00 2.58e+01 0.00e+00  -1.0     -   0.00e+00  0  0 
   1  1.3907403e+04 0.00e+00 1.86e+01 0.00e+00  -1.0    2.0  1.00e+00  1  1f
   2  7.7473777e+03 0.00e+00 1.08e+01 0.00e+00  -1.0    1.5  1.00e+00  1  1f
   3  3.7359464e+03 0.00e+00 5.25e+00 0.00e+00  -1.0    1.0  1.00e+00  1  1f
   4  1.6753846e+03 0.00e+00 2.42e+00 0.00e+00  -1.0    0.6  1.00e+00  1  1f
   5  6.3972053e+02 0.00e+00 1.05e+00 0.00e+00  -1.0    0.1  1.00e+00  1  1f
   6  1.7950135e+02 0.00e+00 4.42e-01 0.00e+00  -1.0   -0.4  1.00e+00  1  1f
   7  4.7035355e+01 0.00e+00 1.59e-01 0.00e+00  -1.7   -0.9  1.00e+00  1  1f
   8  9.3082464e+00 0.00e+00 4.51e-02 0.00e+00  -2.5   -1.3  1.00e+00  1  1f
   9  7.3330376e+00 0.00e+00 1.60e+01 0.00e+00  -2.5     -   2.50e-01  1  3f
iter    objective    inf_pr   inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls
  10  2.0095720e+00 0.00e+00 4.21e+00 0.00e+00  -2.5   -1.8  1.00e+00  1  1f
  11  1.1987495e+00 0.00e+00 1.21e+00 0.00e+00  -2.5   -2.3  1.00e+00  1  1f
  12  1.0448970e+00 0.00e+00 3.55e-01 0.00e+00  -2.5   -2.8  1.00e+00  1  1f
  13  1.0131257e+00 0.00e+00 1.06e-01 0.00e+00  -2.5   -3.2  1.00e+00  1  1f
  14  1.0054169e+00 0.00e+00 3.21e-02 0.00e+00  -2.5   -3.7  1.00e+00  1  1f
  15  1.0027966e+00 0.00e+00 9.99e-03 0.00e+00  -2.5   -4.2  1.00e+00  1  1f
  16  1.0000567e+00 0.00e+00 4.90e-03 0.00e+00  -3.8     -   1.00e+00  1  1f
  17  1.0000001e+00 0.00e+00 2.17e-05 0.00e+00  -3.8     -   1.00e+00  1  1f
  18  1.0000000e+00 0.00e+00 2.21e-12 0.00e+00  -5.7     -   1.00e+00  1  1f

Number of Iterations....: 18

                                   (scaled)                 (unscaled)
Objective...............:   1.0000000000000000e+00    1.0000000000000000e+00
Dual infeasibility......:   2.2103886772350730e-12    2.2103886772350730e-12
Constraint violation....:   0.0000000000000000e+00    0.0000000000000000e+00
Complementarity.........:   0.0000000000000000e+00    0.0000000000000000e+00
Overall NLP error.......:   2.2103886772350730e-12    2.2103886772350730e-12

Number of objective function evaluations              = 25
Number of objective gradient evaluations              = 19
Number of constraint evaluations                      = 25
Number of constraint Jacobian evaluations             = 19
Number of Lagrangian Hessian evaluations              = 18
Number of KKT factorizations                          = 35
Number of KKT backsolves                              = 22

Total wall secs in initialization                     =  0.022 s
Total wall secs in linear solver                      =  0.010 s
Total wall secs in NLP function evaluations           =  0.005 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.011 s
Total wall secs                                       =  0.049 s

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