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

Total number of variables............................:     1000
                     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  1.1144481e+17 0.00e+00 1.00e+02 0.00e+00  -1.0     -   0.00e+00  0  0 
   1  2.2013789e+16 0.00e+00 2.96e+01 0.00e+00  -1.0     -   1.00e+00  1  1f
   2  4.3484027e+15 0.00e+00 8.78e+00 0.00e+00  -1.0     -   1.00e+00  1  1f
   3  8.5894374e+14 0.00e+00 2.60e+00 0.00e+00  -1.0     -   1.00e+00  1  1f
   4  1.6966790e+14 0.00e+00 7.71e-01 0.00e+00  -1.0     -   1.00e+00  1  1f
   5  3.3514646e+13 0.00e+00 2.28e-01 0.00e+00  -1.7     -   1.00e+00  1  1f
   6  6.6201766e+12 0.00e+00 6.77e-02 0.00e+00  -1.7     -   1.00e+00  1  1f
   7  1.3076891e+12 0.00e+00 2.00e-02 0.00e+00  -2.5     -   1.00e+00  1  1f
   8  2.5830888e+11 0.00e+00 5.94e-03 0.00e+00  -3.8     -   1.00e+00  1  1f
   9  5.1023948e+10 0.00e+00 1.76e-03 0.00e+00  -3.8     -   1.00e+00  1  1f
iter    objective    inf_pr   inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls
  10  1.0078791e+10 0.00e+00 5.22e-04 0.00e+00  -3.8     -   1.00e+00  1  1f
  11  1.9908666e+09 0.00e+00 1.55e-04 0.00e+00  -5.7     -   1.00e+00  1  1f
  12  3.9325503e+08 0.00e+00 4.58e-05 0.00e+00  -5.7     -   1.00e+00  1  1f
  13  7.7678863e+07 0.00e+00 1.36e-05 0.00e+00  -5.7     -   1.00e+00  1  1f
  14  1.5343465e+07 0.00e+00 4.02e-06 0.00e+00  -8.6     -   1.00e+00  1  1f
  15  3.0305823e+06 0.00e+00 1.19e-06 0.00e+00  -8.6     -   1.00e+00  1  1f
  16  5.9853326e+05 0.00e+00 3.53e-07 0.00e+00  -8.6     -   1.00e+00  1  1f
  17  1.1818423e+05 0.00e+00 1.05e-07 0.00e+00  -8.6     -   1.00e+00  1  1f
  18  2.3325245e+04 0.00e+00 3.10e-08 0.00e+00  -8.6     -   1.00e+00  1  1f
  19  4.5986749e+03 0.00e+00 9.17e-09 0.00e+00  -8.6     -   1.00e+00  1  1f

Number of Iterations....: 19

                                   (scaled)                 (unscaled)
Objective...............:   3.4438386639916461e-07    4.5986748550988514e+03
Dual infeasibility......:   9.1722992758433719e-09    1.2248083072036918e+02
Constraint violation....:   0.0000000000000000e+00    0.0000000000000000e+00
Complementarity.........:   0.0000000000000000e+00    0.0000000000000000e+00
Overall NLP error.......:   6.8689176510986399e-19    9.1722992758433719e-09

Number of objective function evaluations              = 20
Number of objective gradient evaluations              = 20
Number of constraint evaluations                      = 20
Number of constraint Jacobian evaluations             = 20
Number of Lagrangian Hessian evaluations              = 19
Number of KKT factorizations                          = 19
Number of KKT backsolves                              = 19

Total wall secs in initialization                     =  0.035 s
Total wall secs in linear solver                      =  0.085 s
Total wall secs in NLP function evaluations           =  0.008 s
Total wall secs in solver (w/o init./fun./lin. alg.)  =  0.010 s
Total wall secs                                       =  0.138 s

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