This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 25000 Number of nonzeros in Lagrangian Hessian.............: 10000 Total number of variables............................: 5000 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...............: 5000 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 5000 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 0 0.0000000e+00 1.40e+02 0.00e+00 1.40e-06 -1.0 - 0.00e+00 0 0 1 0.0000000e+00 1.40e+02 2.79e-14 1.00e-06 -1.0 - 1.00e-07 2 2h 2 0.0000000e+00 8.73e-02 7.58e-15 1.00e-06 -1.0 - 1.00e+00 3 1h 3 0.0000000e+00 3.55e-03 1.46e-12 1.00e-06 -2.5 - 1.00e+00 3 1h 4 0.0000000e+00 3.11e-03 1.01e-10 1.00e-06 -3.8 - 1.25e-01 3 4h 5 0.0000000e+00 2.72e-03 1.18e-10 1.00e-06 -3.8 - 1.25e-01 3 4h 6 0.0000000e+00 2.38e-03 3.99e-10 1.00e-06 -3.8 - 1.25e-01 3 4h 7 0.0000000e+00 2.08e-03 7.64e-10 1.00e-06 -3.8 - 1.25e-01 3 4h 8 0.0000000e+00 1.82e-03 1.46e-09 1.00e-06 -3.8 - 1.25e-01 3 4h 9 0.0000000e+00 1.59e-03 2.18e-09 1.00e-06 -3.8 - 1.25e-01 3 4h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 0.0000000e+00 1.40e-03 2.90e-09 1.00e-06 -3.8 - 1.25e-01 3 4h 11 0.0000000e+00 1.22e-03 3.51e-07 1.00e-06 -5.7 - 1.25e-01 3 4h 12 0.0000000e+00 1.07e-03 1.23e-07 1.00e-06 -5.7 - 1.25e-01 3 4h 13 0.0000000e+00 9.35e-04 1.06e-07 1.00e-06 -5.7 - 1.25e-01 3 4h 14 0.0000000e+00 8.18e-04 9.36e-08 1.00e-06 -5.7 - 1.25e-01 3 4h 15 0.0000000e+00 1.52e-03 7.05e-08 1.00e-06 -5.7 - 2.50e-01 3 3h 16 0.0000000e+00 1.15e-03 5.01e-08 1.00e-06 -5.7 - 2.50e-01 3 3h 17 0.0000000e+00 8.72e-04 3.76e-08 1.00e-06 -5.7 - 2.50e-01 3 3h 18 0.0000000e+00 1.23e-03 1.91e-08 1.00e-06 -5.7 - 5.00e-01 3 2h 19 0.0000000e+00 6.55e-04 4.90e-12 1.00e-06 -5.7 - 1.00e+00 3 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 0.0000000e+00 1.35e-04 1.30e-12 1.00e-06 -5.7 - 1.00e+00 3 1h 21 0.0000000e+00 7.00e-05 5.74e-13 1.00e-06 -5.7 - 1.00e+00 3 1h 22 0.0000000e+00 2.57e-05 2.08e-13 1.00e-06 -5.7 - 1.00e+00 3 1h 23 0.0000000e+00 4.39e-06 4.71e-14 1.00e-06 -5.7 - 1.00e+00 3 1h 24 0.0000000e+00 1.39e-07 2.36e-11 2.51e-09 -8.6 - 1.00e+00 2 1h 25 0.0000000e+00 1.30e-10 1.52e-14 2.51e-09 -8.6 - 1.00e+00 2 1h Number of Iterations....: 25 (scaled) (unscaled) Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00 Dual infeasibility......: 1.5224963323024966e-14 1.5224963323024966e-14 Constraint violation....: 1.3003194960670991e-10 1.3003194960670991e-10 Complementarity.........: 2.5059035596800622e-09 2.5059035596800622e-09 Overall NLP error.......: 2.5059035596800622e-09 2.5059035596800622e-09 Number of objective function evaluations = 82 Number of objective gradient evaluations = 26 Number of constraint evaluations = 82 Number of constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Number of KKT factorizations = 25 Number of KKT backsolves = 117 Total wall secs in initialization = 0.025 s Total wall secs in linear solver = 0.058 s Total wall secs in NLP function evaluations = 0.005 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.064 s Total wall secs = 0.153 s EXIT: Optimal Solution Found (tol = 1.0e-08).