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.............: 24994 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...............: 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 6.5610000e-01 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 0 0 1 -5.1410254e+01 0.00e+00 1.00e+02 0.00e+00 -1.0 4.0 1.00e+00 1 1f 2 -2.0818302e+02 0.00e+00 9.99e+01 0.00e+00 -1.0 3.5 1.00e+00 1 1f 3 -6.8324678e+02 0.00e+00 9.92e+01 0.00e+00 -1.0 3.0 1.00e+00 1 1f 4 -2.2574727e+03 0.00e+00 9.25e+01 0.00e+00 -1.0 2.6 1.00e+00 1 1f 5 -2.9044083e+03 0.00e+00 8.88e+01 0.00e+00 -1.0 3.0 1.00e+00 1 1f 6 -7.4616479e+03 0.00e+00 1.84e+02 0.00e+00 -1.0 2.5 1.00e+00 1 1f 7 -1.0618581e+04 0.00e+00 2.38e+02 0.00e+00 -1.0 2.9 1.00e+00 1 1f 8 -7.4441326e+04 0.00e+00 7.46e+02 0.00e+00 -1.0 2.5 1.00e+00 1 1f 9 -1.2994874e+05 0.00e+00 9.91e+02 0.00e+00 -1.0 2.9 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -1.6021882e+06 0.00e+00 2.79e+03 0.00e+00 -1.0 2.4 1.00e+00 1 1f 11 -2.3254646e+06 0.00e+00 5.01e+03 0.00e+00 -1.0 1.9 5.00e-01 1 2f 12 -3.1843293e+06 0.00e+00 1.71e+03 0.00e+00 -1.0 2.4 1.00e+00 1 1f 13 -3.2975809e+06 0.00e+00 9.39e+02 0.00e+00 -1.0 2.8 1.00e+00 1 1f 14 -3.3245214e+06 0.00e+00 7.21e+02 0.00e+00 -1.0 3.2 1.00e+00 1 1f 15 -3.3967556e+06 0.00e+00 7.92e+02 0.00e+00 -1.0 2.7 1.00e+00 1 1f 16 -3.8961400e+06 0.00e+00 1.32e+03 0.00e+00 -1.0 2.3 1.00e+00 1 1f 17 -4.7763060e+06 0.00e+00 6.73e+03 0.00e+00 -1.0 1.8 5.00e-01 1 2f 18 -6.2233856e+06 0.00e+00 3.88e+03 0.00e+00 -1.0 - 1.00e+00 1 1f 19 -6.7132539e+06 0.00e+00 4.81e+02 0.00e+00 -1.0 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 -6.7462209e+06 0.00e+00 4.15e+02 0.00e+00 -1.0 - 1.25e-01 1 4f 21 -6.7566817e+06 0.00e+00 5.16e+01 0.00e+00 -1.0 - 1.00e+00 1 1f 22 -6.7570138e+06 0.00e+00 1.44e-01 0.00e+00 -1.0 - 1.00e+00 1 1f 23 -6.7570138e+06 0.00e+00 2.90e-06 0.00e+00 -2.5 - 1.00e+00 1 1f 24 -6.7570138e+06 0.00e+00 2.33e-12 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: -1.3519435288786705e+05 -6.7570137573355949e+06 Dual infeasibility......: 2.3292381317914129e-12 1.1641532182693481e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.6603403997427232e-14 2.3292381317914129e-12 Number of objective function evaluations = 42 Number of objective gradient evaluations = 25 Number of constraint evaluations = 42 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 51 Number of KKT backsolves = 36 Total wall secs in initialization = 0.028 s Total wall secs in linear solver = 0.018 s Total wall secs in NLP function evaluations = 0.005 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.046 s Total wall secs = 0.096 s EXIT: Optimal Solution Found (tol = 1.0e-08).