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.9382130e+03 0.00e+00 2.61e+01 0.00e+00 -1.0 - 0.00e+00 0 0 1 6.6646851e+03 0.00e+00 4.80e+01 0.00e+00 -1.0 2.0 6.25e-02 1 5f 2 5.7551979e+03 0.00e+00 4.58e+01 0.00e+00 -1.0 2.4 1.00e+00 1 1f 3 1.6590308e+03 0.00e+00 6.59e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f 4 9.7566545e+02 0.00e+00 3.51e+01 0.00e+00 -1.0 2.4 1.00e+00 1 1f 5 3.5062309e+02 0.00e+00 1.58e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f 6 4.8680567e+01 0.00e+00 4.69e+00 0.00e+00 -1.0 1.4 1.00e+00 1 1f 7 1.4335612e+01 0.00e+00 1.41e+00 0.00e+00 -1.0 0.9 1.00e+00 1 1f 8 5.0654843e+00 0.00e+00 1.14e+00 0.00e+00 -1.0 0.5 1.00e+00 1 1f 9 1.5559053e+00 0.00e+00 9.33e-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 3.9894667e-01 0.00e+00 4.07e-01 0.00e+00 -1.7 -0.5 1.00e+00 1 1f 11 1.0895089e-01 0.00e+00 4.37e-01 0.00e+00 -1.7 -1.0 1.00e+00 1 1f 12 5.2701312e-02 0.00e+00 3.83e-02 0.00e+00 -1.7 -0.5 1.00e+00 1 1f 13 2.6697509e-02 0.00e+00 8.15e-02 0.00e+00 -2.5 -1.0 1.00e+00 1 1f 14 1.2439995e-02 0.00e+00 3.99e-02 0.00e+00 -2.5 -1.5 1.00e+00 1 1f 15 6.2749831e-03 0.00e+00 1.14e-01 0.00e+00 -2.5 -2.0 1.00e+00 1 1f 16 4.3652869e-03 0.00e+00 1.25e-03 0.00e+00 -2.5 -0.6 1.00e+00 1 1f 17 3.5215282e-03 0.00e+00 8.11e-02 0.00e+00 -5.7 - 5.00e-01 1 2f 18 9.3650678e-04 0.00e+00 6.32e-04 0.00e+00 -5.7 -1.1 1.00e+00 1 1f 19 4.0090036e-04 0.00e+00 1.93e-02 0.00e+00 -5.7 - 5.00e-01 1 2f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.5831094e-04 0.00e+00 7.41e-04 0.00e+00 -5.7 -1.6 1.00e+00 1 1f 21 1.4762154e-04 0.00e+00 1.98e-02 0.00e+00 -5.7 - 1.00e+00 1 1f 22 1.3061214e-07 0.00e+00 7.72e-06 0.00e+00 -5.7 -2.1 1.00e+00 1 1f 23 3.7914532e-09 0.00e+00 1.25e-04 0.00e+00 -8.6 - 1.00e+00 1 1f 24 4.2236972e-16 0.00e+00 4.66e-10 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 4.2236972006525802e-16 4.2236972006525802e-16 Dual infeasibility......: 4.6619571200600782e-10 4.6619571200600782e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.6619571200600782e-10 4.6619571200600782e-10 Number of objective function evaluations = 43 Number of objective gradient evaluations = 25 Number of constraint evaluations = 43 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 51 Number of KKT backsolves = 36 Total wall secs in initialization = 0.038 s Total wall secs in linear solver = 0.220 s Total wall secs in NLP function evaluations = 0.027 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.016 s Total wall secs = 0.301 s EXIT: Optimal Solution Found (tol = 1.0e-08).