This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 1935 Number of nonzeros in Lagrangian Hessian.............: 117 Total number of variables............................: 9 variables with only lower bounds: 0 variables with lower and upper bounds: 9 variables with only upper bounds: 0 Total number of equality constraints.................: 1 Total number of inequality constraints...............: 214 inequality constraints with only lower bounds: 213 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 1 iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 0 4.3104591e+04 1.49e+00 1.00e+02 9.00e+00 -1.0 - 0.00e+00 1 0 1 4.7746537e+04 1.48e+00 9.92e+01 8.91e+00 -1.0 - 7.86e-03 1 1h 2 5.1157796e+04 1.47e+00 9.86e+01 7.93e+00 -1.0 - 6.72e-03 1 1h 3 7.1865718e+04 1.44e+00 9.64e+01 9.21e+00 -1.0 - 1.89e-02 1 1h 4 7.2669174e+04 1.44e+00 9.65e+01 5.21e+00 -1.0 - 1.35e-03 1 1h 5 7.9290929e+04 1.40e+00 9.36e+01 3.53e+00 -1.0 - 2.87e-02 1 1h 6 1.0265827e+05 1.19e+00 8.02e+01 2.00e+00 -1.0 - 1.45e-01 1 1h 7 1.1430953e+05 1.10e+00 8.35e+01 1.22e+00 -1.0 - 7.71e-02 1 1h 8 1.7511479e+05 6.37e-01 6.76e+01 5.26e-01 -1.0 - 4.23e-01 1 1h 9 1.8364891e+05 5.93e-01 1.79e+02 4.40e-01 -1.0 - 6.87e-02 1 1h iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 2.6466436e+05 2.66e-12 2.24e+02 7.46e-01 -1.0 - 1.00e+00 1 1h 11 2.0876226e+05 9.66e-13 3.45e+01 4.74e-01 -1.0 - 6.35e-01 1 1f 12 6.4659740e+04 2.27e-13 5.72e+01 1.95e-01 -1.0 - 7.56e-01 1 1f 13 7.2561331e+04 2.42e-13 3.41e+01 1.76e-01 -1.0 - 1.25e-01 1 4f 14 2.5468765e+04 1.42e-13 2.57e+01 2.20e-01 -1.0 - 2.74e-01 1 1f 15 3.0977546e+04 5.68e-14 6.16e+00 5.99e-01 -1.0 - 8.76e-01 1 1f 16 1.5987206e+04 4.26e-14 5.37e-01 1.86e-01 -1.0 - 8.92e-01 1 1f 17 1.0373975e+04 4.26e-14 5.05e-14 5.07e-02 -1.7 - 1.00e+00 1 1f 18 7.2238345e+03 4.26e-14 2.01e-02 1.29e-02 -2.5 - 1.00e+00 1 1f 19 6.2329907e+03 5.68e-14 2.48e-03 1.64e-03 -3.8 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 6.1837082e+03 5.68e-14 3.94e-15 2.47e-04 -3.8 - 1.00e+00 1 1f 21 6.1576235e+03 5.68e-14 6.96e-04 6.18e-05 -5.7 - 1.00e+00 1 1f 22 6.1556441e+03 7.11e-14 4.50e-15 3.52e-06 -5.7 - 1.00e+00 1 1f 23 6.1552118e+03 5.68e-14 2.44e-06 3.72e-08 -8.6 - 1.00e+00 1 1f 24 6.1552106e+03 7.11e-14 2.00e-14 2.51e-09 -8.6 - 1.00e+00 1 1h Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 1.8039660591461512e-01 6.1552106171096584e+03 Dual infeasibility......: 1.9984014443252818e-14 6.8186326039750051e-10 Constraint violation....: 7.1054273576010019e-14 7.1054273576010019e-14 Complementarity.........: 7.3485472540388696e-14 2.5073562692083634e-09 Overall NLP error.......: 2.5073562692083634e-09 2.5073562692083634e-09 Number of objective function evaluations = 28 Number of objective gradient evaluations = 25 Number of constraint evaluations = 28 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 25 Number of KKT backsolves = 25 Total wall secs in initialization = 0.006 s Total wall secs in linear solver = 0.037 s Total wall secs in NLP function evaluations = 0.008 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.056 s Total wall secs = 0.107 s EXIT: Optimal Solution Found (tol = 1.0e-08).