This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 15128 Number of nonzeros in Lagrangian Hessian.............: 30253 Total number of variables............................: 7564 variables with only lower bounds: 2521 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 3844 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 3844 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 0 8.2832512e+01 1.00e+01 9.95e-01 1.00e-02 -1.0 - 0.00e+00 0 0 1 8.2832513e+01 1.00e+01 2.42e-01 1.87e-05 -1.0 - 1.00e-07 1 2h 2 8.5181097e+01 9.31e+00 3.06e-02 1.72e-05 -1.0 - 6.89e-02 3 1h 3 8.9644139e+01 8.67e+00 1.82e-02 4.24e-06 -1.0 - 6.89e-02 7 1h 4 9.6283974e+01 8.11e+00 1.30e-02 3.70e-06 -1.0 -4.0 6.45e-02 1 1h 5 1.1052404e+02 7.21e+00 9.24e-03 3.34e-06 -1.0 -4.5 1.10e-01 1 1h 6 3.2325048e+02 3.65e-07 6.59e-03 8.96e-06 -1.0 -5.0 1.00e+00 1 1h 7 2.7764516e+02 9.44e-08 6.43e-03 8.40e-06 -3.8 -5.4 6.04e-01 1 1f 8 2.6042744e+02 7.90e-09 6.66e-03 8.43e-06 -3.8 -5.9 6.68e-01 1 1f 9 2.5266798e+02 1.11e-08 6.75e-03 8.35e-06 -3.8 -6.4 8.22e-01 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 2.4801433e+02 2.92e-09 6.70e-03 8.39e-06 -3.8 -6.9 1.00e+00 1 1f 11 2.4583837e+02 9.85e-16 6.46e-01 8.12e-06 -3.8 - 1.00e+00 10 1f 12 2.4471500e+02 6.95e-16 7.46e-03 7.59e-06 -3.8 - 9.97e-01 7 1f 13 2.4414999e+02 8.81e-16 3.57e-03 6.57e-06 -3.8 - 1.00e+00 4 1f 14 2.4387459e+02 1.25e-15 2.36e-03 4.77e-06 -3.8 - 1.00e+00 3 1f 15 2.4375536e+02 1.35e-15 6.85e-04 2.49e-06 -3.8 - 1.00e+00 2 1f 16 2.4359457e+02 1.34e-15 7.39e-04 5.24e-06 -5.7 - 8.87e-01 2 1f 17 2.4355579e+02 1.50e-15 4.36e-04 1.02e-05 -5.7 - 8.67e-01 2 1f 18 2.4354578e+02 1.14e-15 3.95e-04 6.85e-06 -5.7 - 9.68e-01 2 1f 19 2.4354454e+02 1.06e-15 1.58e-07 2.43e-06 -5.7 - 1.00e+00 2 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 2.4354275e+02 2.21e-15 9.95e-04 1.06e-06 -8.6 - 8.18e-01 2 1f 21 2.4354237e+02 1.20e-15 2.79e-02 4.28e-07 -8.6 - 8.31e-01 2 1f 22 2.4354228e+02 7.93e-16 1.40e-01 1.43e-07 -8.6 - 9.98e-01 1 1f 23 2.4354227e+02 8.54e-16 4.13e-03 3.48e-08 -8.6 - 1.00e+00 2 1f 24 2.4354226e+02 8.03e-16 1.15e-10 9.92e-09 -8.6 - 1.00e+00 2 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 2.4354226136947483e+02 2.4354226136947483e+02 Dual infeasibility......: 1.1454005105493437e-10 1.1454005105493437e-10 Constraint violation....: 8.0269642707220513e-16 8.0269642707220513e-16 Complementarity.........: 9.9179389783852746e-09 9.9179389783852746e-09 Overall NLP error.......: 9.9179389783852746e-09 9.9179389783852746e-09 Number of objective function evaluations = 26 Number of objective gradient evaluations = 25 Number of constraint evaluations = 26 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 31 Number of KKT backsolves = 81 Total wall secs in initialization = 0.065 s Total wall secs in linear solver = 0.106 s Total wall secs in NLP function evaluations = 0.008 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.046 s Total wall secs = 0.224 s EXIT: Optimal Solution Found (tol = 1.0e-08).