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.............: 524800 Total number of variables............................: 1024 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 7.9264442e+03 0.00e+00 2.60e+01 0.00e+00 -1.0 - 0.00e+00 0 0 1 6.6742804e+03 0.00e+00 5.02e+01 0.00e+00 -1.0 2.0 6.25e-02 1 5f 2 5.7589686e+03 0.00e+00 4.66e+01 0.00e+00 -1.0 2.4 1.00e+00 1 1f 3 1.6495018e+03 0.00e+00 6.55e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f 4 9.7246561e+02 0.00e+00 3.50e+01 0.00e+00 -1.0 2.4 1.00e+00 1 1f 5 3.5112144e+02 0.00e+00 1.55e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f 6 4.9613281e+01 0.00e+00 4.63e+00 0.00e+00 -1.0 1.4 1.00e+00 1 1f 7 1.4737600e+01 0.00e+00 1.45e+00 0.00e+00 -1.0 0.9 1.00e+00 1 1f 8 5.2361545e+00 0.00e+00 1.20e+00 0.00e+00 -1.0 0.5 1.00e+00 1 1f 9 1.6291101e+00 0.00e+00 9.83e-01 0.00e+00 -1.0 -0.0 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 4.2757703e-01 0.00e+00 4.09e-01 0.00e+00 -1.7 -0.5 1.00e+00 1 1f 11 1.2115017e-01 0.00e+00 4.50e-01 0.00e+00 -1.7 -1.0 1.00e+00 1 1f 12 5.8975971e-02 0.00e+00 3.92e-02 0.00e+00 -1.7 -0.5 1.00e+00 1 1f 13 5.3936167e-02 0.00e+00 1.50e-01 0.00e+00 -2.5 - 1.25e-01 1 4f 14 3.7231992e-02 0.00e+00 1.21e-02 0.00e+00 -2.5 -0.1 1.00e+00 1 1f 15 2.6823721e-02 0.00e+00 1.75e-02 0.00e+00 -3.8 -0.6 1.00e+00 1 1f 16 1.9944322e-02 0.00e+00 2.58e-01 0.00e+00 -3.8 - 5.00e-01 1 2f 17 6.3583778e-03 0.00e+00 2.58e-03 0.00e+00 -3.8 -0.2 1.00e+00 1 1f 18 2.2165863e-03 0.00e+00 4.21e-02 0.00e+00 -3.8 - 5.00e-01 1 2f 19 1.3546608e-03 0.00e+00 9.58e-04 0.00e+00 -3.8 -0.6 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.2857436e-03 0.00e+00 6.11e-02 0.00e+00 -5.7 - 1.00e+00 1 1f 21 4.9256846e-07 0.00e+00 6.07e-05 0.00e+00 -5.7 -1.1 1.00e+00 1 1f 22 4.2720709e-09 0.00e+00 1.38e-04 0.00e+00 -5.7 - 1.00e+00 1 1f 23 1.3105637e-13 0.00e+00 5.10e-08 0.00e+00 -5.7 - 1.00e+00 1 1f 24 1.3652731e-21 0.00e+00 8.71e-11 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 1.3652731333195307e-21 1.3652731333195307e-21 Dual infeasibility......: 8.7065678720693829e-11 8.7065678720693829e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 8.7065678720693829e-11 8.7065678720693829e-11 Number of objective function evaluations = 50 Number of objective gradient evaluations = 25 Number of constraint evaluations = 50 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 49 Number of KKT backsolves = 40 Total wall secs in initialization = 0.036 s Total wall secs in linear solver = 0.226 s Total wall secs in NLP function evaluations = 0.029 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.022 s Total wall secs = 0.312 s EXIT: Optimal Solution Found (tol = 1.0e-08).