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.............: 7500 Total number of variables............................: 5000 variables with only lower bounds: 0 variables with lower and upper bounds: 5000 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.2502485e+06 0.00e+00 1.00e+02 9.99e+00 -1.0 - 0.00e+00 0 0 1 -9.7001791e+07 0.00e+00 9.90e+01 9.79e+00 -1.0 - 1.00e+00 1 1f 2 -3.9362075e+08 0.00e+00 9.89e+01 9.78e+00 -1.0 - 1.06e-02 1 1f 3 -7.0665517e+08 0.00e+00 9.81e+01 9.71e+00 -1.0 - 1.11e-02 1 1f 4 -1.0004714e+09 0.00e+00 9.72e+01 9.62e+00 -1.0 - 1.85e-02 1 1f 5 -1.1352203e+09 0.00e+00 9.59e+01 9.48e+00 -1.0 - 2.75e-02 1 1f 6 -1.1980272e+09 0.00e+00 9.41e+01 9.31e+00 -1.0 - 4.09e-02 1 1f 7 -1.2256514e+09 0.00e+00 9.16e+01 9.06e+00 -1.0 - 5.88e-02 1 1f 8 -1.2383268e+09 0.00e+00 8.84e+01 8.74e+00 -1.0 - 8.32e-02 1 1f 9 -1.2442802e+09 0.00e+00 8.41e+01 8.32e+00 -1.0 - 1.16e-01 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -1.2471282e+09 0.00e+00 7.86e+01 7.77e+00 -1.0 - 1.59e-01 1 1f 11 -1.2485034e+09 0.00e+00 7.16e+01 7.08e+00 -1.0 - 2.15e-01 1 1f 12 -1.2491681e+09 0.00e+00 6.32e+01 6.25e+00 -1.0 - 2.85e-01 1 1f 13 -1.2494868e+09 0.00e+00 5.35e+01 5.28e+00 -1.0 - 3.72e-01 1 1f 14 -1.2496367e+09 0.00e+00 4.27e+01 4.22e+00 -1.0 - 4.74e-01 1 1f 15 -1.2497050e+09 0.00e+00 3.16e+01 3.13e+00 -1.0 - 5.91e-01 1 1f 16 -1.2497343e+09 0.00e+00 2.09e+01 2.09e+00 -1.0 - 7.19e-01 1 1f 17 -1.2497459e+09 0.00e+00 1.15e+01 1.19e+00 -1.0 - 8.57e-01 1 1f 18 -1.2497496e+09 0.00e+00 3.96e+00 4.99e-01 -1.0 - 1.00e+00 1 1f 19 -1.2497503e+09 0.00e+00 1.42e-14 1.78e-01 -1.0 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 -1.2499927e+09 0.00e+00 1.59e-03 5.95e-02 -2.5 - 1.00e+00 1 1f 21 -1.2499929e+09 0.00e+00 2.13e-14 1.63e-02 -2.5 - 1.00e+00 1 1f 22 -1.2499996e+09 0.00e+00 9.61e-04 4.17e-03 -3.8 - 1.00e+00 1 1f 23 -1.2499996e+09 0.00e+00 1.42e-14 3.69e-04 -3.8 - 1.00e+00 1 1f 24 -1.2500000e+09 0.00e+00 2.84e-14 1.68e-05 -5.7 - 1.00e+00 1 1f 25 -1.2500000e+09 0.00e+00 2.84e-14 1.42e-08 -8.6 - 1.00e+00 1 1f 26 -1.2500000e+09 0.00e+00 6.86e-07 1.93e-09 -9.0 - 4.19e-01 1 1f 27 -1.2500000e+09 0.00e+00 2.13e-02 3.57e-09 -9.0 - 2.77e-03 1 9f 28 -1.2500000e+09 0.00e+00 2.13e-14 1.40e-09 -9.0 - 1.00e+00 1 1f Number of Iterations....: 28 (scaled) (unscaled) Objective...............: -2.5000000249904576e+06 -1.2500000124952288e+09 Dual infeasibility......: 2.1316282072803006e-14 1.0658141036401503e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 2.8096517493338357e-12 1.4048258746669179e-09 Overall NLP error.......: 1.4048258746669179e-09 1.4048258746669179e-09 Number of objective function evaluations = 41 Number of objective gradient evaluations = 29 Number of constraint evaluations = 41 Number of constraint Jacobian evaluations = 29 Number of Lagrangian Hessian evaluations = 28 Number of KKT factorizations = 28 Number of KKT backsolves = 32 Total wall secs in initialization = 0.023 s Total wall secs in linear solver = 0.019 s Total wall secs in NLP function evaluations = 0.004 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.042 s Total wall secs = 0.087 s EXIT: Optimal Solution Found (tol = 1.0e-08).