This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 50286 Number of nonzeros in Lagrangian Hessian.............: 22743 Total number of variables............................: 27543 variables with only lower bounds: 27543 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 8000 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.0083867e+04 2.98e+00 2.02e+00 1.00e-02 -1.0 - 0.00e+00 1 0 1 1.0079399e+04 2.97e+00 2.02e+00 1.02e-02 -1.0 - 2.17e-03 1 1h 2 1.0053745e+04 2.97e+00 3.50e+00 1.10e-02 -1.0 - 1.20e-03 1 1h 3 9.9939152e+03 2.96e+00 3.61e+00 1.12e-02 -1.0 - 2.10e-03 1 1h 4 9.9313289e+03 2.96e+00 4.64e+00 1.13e-02 -1.0 - 2.09e-03 1 1h 5 9.8210850e+03 2.95e+00 4.88e+00 1.16e-02 -1.0 - 3.78e-03 1 1h 6 8.0045666e+03 2.66e+00 5.37e+01 4.27e-02 -1.0 - 9.72e-02 1 1h 7 3.5672318e+04 9.26e-01 7.42e+01 1.50e-01 -1.0 - 6.52e-01 1 1h 8 4.3599625e+04 5.22e-01 5.36e+01 1.89e-01 -1.0 - 4.36e-01 1 1h 9 5.5728517e+04 4.26e-14 1.98e+01 2.22e-01 -1.0 - 1.00e+00 1 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 5.4417515e+04 1.29e-14 4.68e+00 1.35e-01 -1.0 - 1.00e+00 1 1f 11 5.4478343e+04 3.55e-15 1.00e-06 1.61e-01 -1.0 - 1.00e+00 1 1f 12 5.4266204e+04 5.33e-15 3.89e-01 5.21e-02 -2.5 - 9.91e-01 1 1f 13 5.4243842e+04 1.02e-14 8.22e-03 1.47e-02 -2.5 - 1.00e+00 1 1f 14 5.4231995e+04 4.44e-15 3.87e-03 3.20e-03 -3.8 - 1.00e+00 1 1f 15 5.4229938e+04 7.33e-15 1.50e-09 7.17e-04 -3.8 - 1.00e+00 1 1f 16 5.4229188e+04 7.99e-15 1.89e-04 1.83e-04 -5.7 - 1.00e+00 1 1f 17 5.4229047e+04 5.33e-15 1.85e-11 4.66e-05 -5.7 - 1.00e+00 2 1f 18 5.4229012e+04 5.33e-15 1.85e-11 1.26e-05 -5.7 - 1.00e+00 1 1f 19 5.4228999e+04 6.22e-15 3.74e-06 3.15e-06 -8.6 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 5.4228997e+04 5.33e-15 3.55e-14 7.90e-07 -8.6 - 1.00e+00 2 1f 21 5.4228996e+04 4.44e-15 3.21e-14 1.99e-07 -8.6 - 1.00e+00 1 1f 22 5.4228996e+04 5.33e-15 3.22e-14 5.09e-08 -8.6 - 1.00e+00 1 1f 23 5.4228996e+04 5.33e-15 3.20e-14 1.40e-08 -8.6 - 1.00e+00 1 1f 24 5.4228996e+04 4.44e-15 2.13e-14 3.97e-09 -9.0 - 1.00e+00 2 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 5.4228996128342296e+04 5.4228996128342296e+04 Dual infeasibility......: 2.1316282072803006e-14 2.1316282072803006e-14 Constraint violation....: 4.4408920985006262e-15 4.4408920985006262e-15 Complementarity.........: 3.9738166022277876e-09 3.9738166022277876e-09 Overall NLP error.......: 3.9738166022277876e-09 3.9738166022277876e-09 Number of objective function evaluations = 25 Number of objective gradient evaluations = 25 Number of constraint evaluations = 25 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 25 Number of KKT backsolves = 28 Total wall secs in initialization = 0.010 s Total wall secs in linear solver = 0.634 s Total wall secs in NLP function evaluations = 0.006 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.049 s Total wall secs = 0.700 s EXIT: Optimal Solution Found (tol = 1.0e-08).