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.............: 29997 Total number of variables............................: 10000 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 8.7749480e+03 0.00e+00 9.59e-01 0.00e+00 -1.0 - 0.00e+00 1 0 1 8.7208602e+03 0.00e+00 9.97e-01 0.00e+00 -1.7 2.0 1.00e+00 1 1f 2 8.5309130e+03 0.00e+00 1.13e+00 0.00e+00 -1.7 1.5 1.00e+00 1 1f 3 7.5238868e+03 0.00e+00 1.90e+00 0.00e+00 -1.7 1.0 1.00e+00 1 1f 4 6.9639894e+03 0.00e+00 2.26e+00 0.00e+00 -1.7 1.5 1.00e+00 1 1f 5 3.0642973e+03 0.00e+00 2.55e+00 0.00e+00 -1.7 1.0 1.00e+00 1 1f 6 8.1607179e+02 0.00e+00 2.58e+00 0.00e+00 -1.7 1.4 1.00e+00 1 1f 7 -8.7212441e+03 0.00e+00 2.02e+00 0.00e+00 -1.7 0.9 1.00e+00 1 1f 8 -9.9954693e+03 0.00e+00 1.75e-01 0.00e+00 -1.7 0.5 1.00e+00 1 1f 9 -9.9989848e+03 0.00e+00 9.55e-03 0.00e+00 -2.5 -0.0 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -9.9990000e+03 0.00e+00 2.12e-04 0.00e+00 -3.8 -0.5 1.00e+00 1 1f 11 -9.9990000e+03 0.00e+00 1.68e-06 0.00e+00 -5.7 -1.0 1.00e+00 1 1f 12 -9.9990000e+03 0.00e+00 4.68e-09 0.00e+00 -8.6 -1.4 1.00e+00 1 1f Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -9.9990000000000000e+03 -9.9990000000000000e+03 Dual infeasibility......: 4.6785315016300029e-09 4.6785315016300029e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.6785315016300029e-09 4.6785315016300029e-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 = 30 Number of KKT backsolves = 13 Total wall secs in initialization = 0.005 s Total wall secs in linear solver = 0.055 s Total wall secs in NLP function evaluations = 0.002 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.011 s Total wall secs = 0.073 s EXIT: Optimal Solution Found (tol = 1.0e-08).