This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 30 Number of nonzeros in Lagrangian Hessian.............: 29 Total number of variables............................: 8 variables with only lower bounds: 0 variables with lower and upper bounds: 8 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 10 inequality constraints with only lower bounds: 10 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 -7.7500000e+00 4.01e+00 3.50e+00 2.00e+00 -1.0 - 0.00e+00 0 0 1 -7.3771354e+00 2.83e+00 3.17e+00 1.19e+00 -1.0 - 2.95e-01 1 1h 2 -5.1609019e+00 8.04e-01 1.40e+00 8.70e-01 -1.0 - 7.16e-01 1 1h 3 -4.1089576e+00 1.31e-01 4.26e+00 5.95e-01 -1.0 - 8.37e-01 1 1h 4 -3.9317019e+00 8.72e-15 3.96e-13 1.51e-01 -1.0 - 1.00e+00 1 1h 5 -4.3181909e+00 2.22e-16 4.95e-01 4.08e-02 -2.5 - 1.00e+00 1 1f 6 -4.4565265e+00 6.66e-16 2.93e-14 1.11e-02 -2.5 - 1.00e+00 1 1f 7 -4.4807970e+00 4.40e-16 4.28e-03 2.43e-03 -3.8 - 9.07e-01 1 1f 8 -4.4824188e+00 2.62e-16 1.34e-13 3.49e-04 -3.8 - 1.00e+00 1 1f 9 -4.4832117e+00 4.01e-16 7.99e-15 5.97e-05 -5.7 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -4.4832102e+00 2.22e-16 1.05e-13 5.28e-06 -5.7 - 1.00e+00 1 1f 11 -4.4832194e+00 6.47e-16 1.24e-14 4.05e-08 -8.6 - 1.00e+00 1 1f 12 -4.4832194e+00 2.62e-16 1.78e-15 2.51e-09 -8.6 - 1.00e+00 2 1h Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -4.4832194072319806e+00 -4.4832194072319806e+00 Dual infeasibility......: 1.7763568394002505e-15 1.7763568394002505e-15 Constraint violation....: 2.6159280153418366e-16 2.6159280153418366e-16 Complementarity.........: 2.5078595591217792e-09 2.5078595591217792e-09 Overall NLP error.......: 2.5078595591217792e-09 2.5078595591217792e-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 = 12 Number of KKT backsolves = 13 Total wall secs in initialization = 0.014 s Total wall secs in linear solver = 0.007 s Total wall secs in NLP function evaluations = 0.003 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.021 s Total wall secs = 0.045 s EXIT: Optimal Solution Found (tol = 1.0e-08).