This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 36000 Number of nonzeros in Lagrangian Hessian.............: 108000 Total number of variables............................: 8003 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...............: 4000 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 4000 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.22e+02 0.00e+00 1.66e-08 -1.0 - 0.00e+00 0 0 1 3.4936231e-13 1.22e+02 5.15e-08 8.76e-07 -1.0 - 5.83e-08 9 1h 2 1.0277425e+02 3.82e+02 3.38e-03 4.42e-07 -1.0 -4.0 1.00e+00 5 1h 3 1.0955503e+01 1.08e+02 2.31e-04 4.42e-07 -1.0 -4.5 1.00e+00 5 1h 4 1.0552468e+03 1.17e+02 4.01e-02 4.42e-07 -1.0 -5.0 1.00e+00 4 1h 5 4.4340134e+02 2.99e+01 2.81e-02 4.42e-07 -1.0 0.9 1.00e+00 3 1h 6 3.4544504e+02 3.19e+00 1.30e-03 4.42e-07 -1.0 0.4 1.00e+00 3 1h 7 3.1367053e+02 9.62e-02 8.87e-05 4.42e-07 -1.0 -0.1 1.00e+00 4 1h 8 3.1106215e+02 3.87e-03 7.05e-05 4.42e-07 -2.5 -0.5 1.00e+00 2 1h 9 3.1101541e+02 8.02e-05 3.70e-06 4.42e-07 -3.8 -1.0 1.00e+00 3 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 3.1101531e+02 1.90e-07 2.13e-06 4.43e-07 -5.7 -1.5 1.00e+00 5 1h 11 3.1101531e+02 5.05e-11 3.14e-08 2.55e-09 -8.6 -2.0 1.00e+00 8 1h 12 3.1101531e+02 9.18e-14 2.60e-13 2.51e-09 -8.6 - 1.00e+00 4 1h Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 3.1101531139019733e+02 3.1101531139019733e+02 Dual infeasibility......: 2.6023627697213669e-13 2.6023627697213669e-13 Constraint violation....: 9.1783838884699571e-14 9.1783838884699571e-14 Complementarity.........: 2.5059175729398467e-09 2.5059175729398467e-09 Overall NLP error.......: 2.5059175729398467e-09 2.5059175729398467e-09 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of constraint evaluations = 13 Number of constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Number of KKT factorizations = 29 Number of KKT backsolves = 65 Total wall secs in initialization = 0.037 s Total wall secs in linear solver = 0.030 s Total wall secs in NLP function evaluations = 0.003 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.095 s Total wall secs = 0.164 s EXIT: Optimal Solution Found (tol = 1.0e-08).