This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 62 Number of nonzeros in Lagrangian Hessian.............: 8 Total number of variables............................: 31 variables with only lower bounds: 0 variables with lower and upper bounds: 31 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 10 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 10 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 0 3.5499965e+00 1.12e+03 1.00e+02 1.20e+03 -1.0 - 0.00e+00 0 0 1 3.5502837e+00 1.12e+03 1.00e+02 1.20e+03 -1.0 - 1.43e-07 1 1h 2 3.5505128e+00 1.12e+03 3.69e+02 1.20e+03 -1.0 - 1.09e-07 1 2h 3 3.6946636e+00 1.12e+03 1.03e+02 1.05e+03 -1.0 - 7.33e-05 2 1h 4 4.4766189e+00 1.12e+03 1.59e+02 3.71e+02 -1.0 - 1.44e-04 2 1h 5 5.8113248e+00 1.12e+03 9.99e+01 2.73e+02 -1.0 - 1.52e-04 2 1h 6 1.2240606e+01 1.12e+03 1.04e+02 9.72e+01 -1.0 - 7.13e-04 3 1h 7 1.8038388e+01 1.12e+03 7.49e+02 6.63e+01 -1.0 - 7.01e-04 3 1h 8 2.6770674e+01 1.12e+03 5.38e+02 1.99e+01 -1.0 - 1.15e-03 3 1h 9 3.1087942e+01 1.11e+03 4.51e+02 1.19e+01 -1.0 -4.0 3.11e-03 1 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 4.5063498e+01 1.11e+03 2.75e+02 4.77e+00 -1.0 - 4.56e-03 4 1h 11 4.1946830e+02 1.01e+03 1.19e+02 1.05e+00 -1.0 - 8.98e-02 3 1h 12 3.7539126e+03 5.66e+02 1.19e+02 3.67e-01 -1.0 - 4.39e-01 8 1h 13 3.9248836e+03 5.49e+02 1.16e+02 3.58e-01 -1.0 -4.5 3.06e-02 1 1h 14 4.3643700e+03 4.80e+02 9.77e+01 3.02e-01 -1.0 - 1.25e-01 10 1h 15 1.1288443e+04 5.86e-01 9.37e+01 2.92e-01 -1.0 -5.0 9.99e-01 1 1h 16 1.0920173e+04 2.50e-01 4.26e+01 1.26e-01 -1.0 - 5.74e-01 10 1h 17 1.0837605e+04 9.12e-02 2.94e+01 8.56e-02 -1.0 -5.4 6.35e-01 1 1h 18 1.0608080e+04 4.01e-02 1.87e+01 5.43e-02 -1.0 -5.9 5.61e-01 1 1f 19 1.0603809e+04 3.84e-02 1.18e+00 4.26e-03 -1.0 -6.4 4.06e-02 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.0553617e+04 2.95e-09 9.77e-02 5.00e-04 -1.0 -6.9 1.00e+00 1 1f 21 1.0549588e+04 5.40e-10 5.55e-03 8.60e-05 -2.5 -7.3 9.73e-01 1 1f 22 1.0549386e+04 7.36e-09 1.64e-05 4.20e-05 -3.8 -7.8 1.00e+00 1 1f 23 1.0549380e+04 9.98e-09 2.76e-03 4.36e-06 -5.7 -8.3 1.00e+00 1 1f 25 1.0549380e+04 1.00e-08 5.77e-14 3.26e-09 -5.7 - 1.00e+00 1 22R Number of Iterations....: 25 (scaled) (unscaled) Objective...............: 5.0235140659562758e+03 1.0549379538508179e+04 Dual infeasibility......: 5.7738909769589175e-14 1.2125171051613727e-13 Constraint violation....: 9.9967055946160871e-09 9.9967055946160871e-09 Complementarity.........: 1.5545814768004786e-09 3.2646211012810052e-09 Overall NLP error.......: 9.9967055946160871e-09 9.9967055946160871e-09 Number of objective function evaluations = 48 Number of objective gradient evaluations = 25 Number of constraint evaluations = 48 Number of constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 35 Number of KKT backsolves = 64 Total wall secs in initialization = 0.014 s Total wall secs in linear solver = 0.030 s Total wall secs in NLP function evaluations = 0.006 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.040 s Total wall secs = 0.090 s EXIT: Optimal Solution Found (tol = 1.0e-08).