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.............: 209790 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 -1.3436758e+00 0.00e+00 3.86e+00 0.00e+00 -1.0 - 0.00e+00 1 0 1 -1.4375631e+00 0.00e+00 3.93e+00 0.00e+00 -1.0 6.0 1.00e+00 1 1f 2 -1.7459775e+00 0.00e+00 4.15e+00 0.00e+00 -1.0 5.5 1.00e+00 1 1f 3 -2.9821286e+00 0.00e+00 4.93e+00 0.00e+00 -1.0 5.0 1.00e+00 1 1f 4 -1.4163535e+01 0.00e+00 9.40e+00 0.00e+00 -1.0 4.6 1.00e+00 1 1f 5 -2.1590495e+01 0.00e+00 1.14e+01 0.00e+00 -1.0 5.0 1.00e+00 1 1f 6 -1.0465850e+02 0.00e+00 2.46e+01 0.00e+00 -1.0 4.5 1.00e+00 1 1f 7 -1.6458283e+02 0.00e+00 3.08e+01 0.00e+00 -1.0 4.9 1.00e+00 1 1f 8 -1.0481884e+03 0.00e+00 7.75e+01 0.00e+00 -1.0 4.5 1.00e+00 1 1f 9 -1.7493483e+03 0.00e+00 1.00e+02 0.00e+00 -1.0 4.9 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -1.6661100e+04 0.00e+00 3.05e+02 0.00e+00 -1.0 4.4 1.00e+00 1 1f 11 -2.9575742e+04 0.00e+00 4.02e+02 0.00e+00 -1.0 4.8 1.00e+00 1 1f 12 -3.7061704e+05 0.00e+00 1.02e+03 0.00e+00 -1.0 4.4 1.00e+00 1 1f 13 -5.3891418e+05 0.00e+00 1.02e+03 0.00e+00 -1.0 4.8 1.00e+00 1 1f 14 -9.7136062e+05 0.00e+00 8.90e+02 0.00e+00 -1.0 4.3 1.00e+00 1 1f 15 -1.0018305e+06 0.00e+00 1.08e+03 0.00e+00 -1.0 3.8 1.00e+00 1 1f 16 -1.0025082e+06 0.00e+00 2.61e+02 0.00e+00 -1.0 3.4 1.00e+00 1 1f 17 -1.0027481e+06 0.00e+00 1.05e+02 0.00e+00 -1.0 2.9 1.00e+00 1 1f 18 -1.0029001e+06 0.00e+00 5.77e+01 0.00e+00 -1.0 2.4 1.00e+00 1 1f 19 -1.0030037e+06 0.00e+00 3.25e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 -1.0030733e+06 0.00e+00 1.82e+01 0.00e+00 -1.0 1.5 1.00e+00 1 1f 21 -1.0030799e+06 0.00e+00 1.70e+02 0.00e+00 -1.0 - 1.00e+00 1 1f 22 -1.0031570e+06 0.00e+00 3.46e+01 0.00e+00 -1.0 - 1.00e+00 1 1f 23 -1.0031628e+06 0.00e+00 4.06e+00 0.00e+00 -1.0 - 1.00e+00 1 1f 24 -1.0031629e+06 0.00e+00 8.97e-02 0.00e+00 -1.0 - 1.00e+00 1 1f 25 -1.0031629e+06 0.00e+00 4.75e-05 0.00e+00 -2.5 - 1.00e+00 1 1f 26 -1.0031629e+06 0.00e+00 1.34e-11 0.00e+00 -5.7 - 1.00e+00 1 1f Number of Iterations....: 26 (scaled) (unscaled) Objective...............: -1.0031629024133105e+06 -1.0031629024133105e+06 Dual infeasibility......: 1.3365308859647484e-11 1.3365308859647484e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.3365308859647484e-11 1.3365308859647484e-11 Number of objective function evaluations = 27 Number of objective gradient evaluations = 27 Number of constraint evaluations = 27 Number of constraint Jacobian evaluations = 27 Number of Lagrangian Hessian evaluations = 26 Number of KKT factorizations = 57 Number of KKT backsolves = 27 Total wall secs in initialization = 0.016 s Total wall secs in linear solver = 0.199 s Total wall secs in NLP function evaluations = 0.035 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.023 s Total wall secs = 0.274 s EXIT: Optimal Solution Found (tol = 1.0e-08).