This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 500500 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.................: 1000 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 0.0000000e+00 5.00e+05 0.00e+00 0.00e+00 -1.0 - 0.00e+00 0 0 1 0.0000000e+00 1.25e+05 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 2 0.0000000e+00 3.12e+04 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 3 0.0000000e+00 7.80e+03 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 4 0.0000000e+00 2.31e+03 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 5 0.0000000e+00 7.56e+02 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 6 0.0000000e+00 2.48e+02 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 7 0.0000000e+00 8.11e+01 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 8 0.0000000e+00 2.66e+01 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 9 0.0000000e+00 8.71e+00 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 0.0000000e+00 2.85e+00 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 11 0.0000000e+00 9.35e-01 0.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1h 12 0.0000000e+00 3.06e-01 0.00e+00 0.00e+00 -1.7 - 1.00e+00 1 1h 13 0.0000000e+00 1.00e-01 0.00e+00 0.00e+00 -1.7 - 1.00e+00 1 1h 14 0.0000000e+00 3.29e-02 0.00e+00 0.00e+00 -2.5 - 1.00e+00 1 1h 15 0.0000000e+00 1.08e-02 0.00e+00 0.00e+00 -2.5 - 1.00e+00 1 1h 16 0.0000000e+00 3.53e-03 0.00e+00 0.00e+00 -3.8 - 1.00e+00 1 1h 17 0.0000000e+00 1.16e-03 0.00e+00 0.00e+00 -3.8 - 1.00e+00 1 1h 18 0.0000000e+00 3.79e-04 0.00e+00 0.00e+00 -5.7 - 1.00e+00 1 1h 19 0.0000000e+00 1.24e-04 0.00e+00 0.00e+00 -5.7 - 1.00e+00 1 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 0.0000000e+00 4.07e-05 0.00e+00 0.00e+00 -5.7 - 1.00e+00 1 1h 21 0.0000000e+00 1.33e-05 0.00e+00 0.00e+00 -5.7 - 1.00e+00 1 1h 22 0.0000000e+00 4.37e-06 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 23 0.0000000e+00 1.43e-06 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 24 0.0000000e+00 4.70e-07 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 25 0.0000000e+00 1.54e-07 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 26 0.0000000e+00 5.04e-08 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 27 0.0000000e+00 1.65e-08 0.00e+00 0.00e+00 -8.6 - 1.00e+00 1 1h 28 0.0000000e+00 5.42e-09 0.00e+00 0.00e+00 -9.0 - 1.00e+00 1 1h Number of Iterations....: 28 (scaled) (unscaled) Objective...............: 0.0000000000000000e+00 0.0000000000000000e+00 Dual infeasibility......: 0.0000000000000000e+00 0.0000000000000000e+00 Constraint violation....: 5.4153704963297291e-09 5.4153704963297291e-09 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 5.4153704963297291e-09 5.4153704963297291e-09 Number of objective function evaluations = 29 Number of objective gradient evaluations = 29 Number of constraint evaluations = 29 Number of constraint Jacobian evaluations = 29 Number of Lagrangian Hessian evaluations = 28 Number of KKT factorizations = 29 Number of KKT backsolves = 28 Total wall secs in initialization = 0.038 s Total wall secs in linear solver = 0.414 s Total wall secs in NLP function evaluations = 0.034 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.047 s Total wall secs = 0.534 s EXIT: Optimal Solution Found (tol = 1.0e-08).