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.............: 55 Total number of variables............................: 10 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 2.8184376e+03 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 0 0 1 2.6994592e+03 0.00e+00 1.09e+01 0.00e+00 -1.0 2.0 1.00e+00 1 1f 2 2.6895603e+03 0.00e+00 4.32e-01 0.00e+00 -1.0 1.5 1.00e+00 1 1f 3 2.6686046e+03 0.00e+00 3.94e-01 0.00e+00 -1.7 1.0 1.00e+00 1 1f 4 2.6269840e+03 0.00e+00 4.99e-01 0.00e+00 -1.7 0.6 1.00e+00 1 1f 5 2.5686427e+03 0.00e+00 8.31e-01 0.00e+00 -1.7 0.1 1.00e+00 1 1f 6 2.4815672e+03 0.00e+00 5.06e+00 0.00e+00 -1.7 -0.4 1.00e+00 1 1f 7 2.3916558e+03 0.00e+00 8.73e+01 0.00e+00 -1.7 - 2.50e-01 1 3f 8 2.3492035e+03 0.00e+00 5.64e+01 0.00e+00 -1.7 -0.9 1.00e+00 1 1f 9 2.3202750e+03 0.00e+00 1.67e+01 0.00e+00 -1.7 -0.4 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 2.3028428e+03 0.00e+00 4.15e+01 0.00e+00 -1.7 - 6.25e-02 1 5f 11 2.2534312e+03 0.00e+00 1.42e+01 0.00e+00 -1.7 - 1.00e+00 1 1f 12 2.2412847e+03 0.00e+00 2.10e+01 0.00e+00 -1.7 - 5.00e-01 1 2f 13 2.2245847e+03 0.00e+00 5.16e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 14 2.2184276e+03 0.00e+00 5.75e+00 0.00e+00 -1.7 - 1.25e-01 1 4f 15 2.2148501e+03 0.00e+00 1.18e+00 0.00e+00 -1.7 - 1.00e+00 1 1f 16 2.2140456e+03 0.00e+00 2.94e+00 0.00e+00 -1.7 - 1.00e+00 1 1f 17 2.2126106e+03 0.00e+00 5.13e-02 0.00e+00 -1.7 - 1.00e+00 1 1f 18 2.2123841e+03 0.00e+00 3.74e-01 0.00e+00 -2.5 - 5.00e-01 1 2f 19 2.2122884e+03 0.00e+00 1.73e-01 0.00e+00 -2.5 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 2.2122650e+03 0.00e+00 5.82e-02 0.00e+00 -2.5 - 1.00e+00 1 1f 21 2.2122624e+03 0.00e+00 9.20e-03 0.00e+00 -2.5 - 1.00e+00 1 1f 22 2.2122623e+03 0.00e+00 2.63e-04 0.00e+00 -3.8 - 1.00e+00 1 1f 23 2.2122623e+03 0.00e+00 2.15e-07 0.00e+00 -5.7 - 1.00e+00 1 1f 24 2.2122623e+03 0.00e+00 9.74e-14 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 4.6651695792791736e+00 2.2122622909073680e+03 Dual infeasibility......: 9.7409471754883315e-14 4.6192383251764113e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 2.0541493033276292e-16 9.7409471754883315e-14 Number of objective function evaluations = 56 Number of objective gradient evaluations = 25 Number of constraint evaluations = 56 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 36 Number of KKT backsolves = 44 Total wall secs in initialization = 0.014 s Total wall secs in linear solver = 0.015 s Total wall secs in NLP function evaluations = 0.036 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.015 s Total wall secs = 0.079 s EXIT: Optimal Solution Found (tol = 1.0e-08).