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.............: 20997 Total number of variables............................: 3000 variables with only lower bounds: 0 variables with lower and upper bounds: 0 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 7.4003547e+04 0.00e+00 7.38e+01 0.00e+00 -1.0 - 0.00e+00 1 0 1 3.5229957e+04 0.00e+00 3.86e+01 0.00e+00 -1.0 2.0 1.00e+00 1 1f 2 1.4287195e+04 0.00e+00 1.76e+01 0.00e+00 -1.0 1.5 1.00e+00 1 1f 3 5.3251887e+03 0.00e+00 7.45e+00 0.00e+00 -1.0 1.0 1.00e+00 1 1f 4 1.9165538e+03 0.00e+00 3.11e+00 0.00e+00 -1.0 0.6 1.00e+00 1 1f 5 1.0690884e+03 0.00e+00 1.94e+00 0.00e+00 -1.0 1.0 1.00e+00 1 1f 6 4.8252097e+02 0.00e+00 1.06e+00 0.00e+00 -1.0 0.5 1.00e+00 1 1f 7 1.6717668e+02 0.00e+00 4.39e-01 0.00e+00 -1.0 0.0 1.00e+00 1 1f 8 9.4757062e+01 0.00e+00 3.13e-01 0.00e+00 -1.7 0.5 1.00e+00 1 1f 9 3.6116658e+01 0.00e+00 1.70e-01 0.00e+00 -1.7 -0.0 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 1.0164050e+01 0.00e+00 9.83e-02 0.00e+00 -2.5 -0.5 1.00e+00 1 1f 11 5.5146003e+00 0.00e+00 1.09e+00 0.00e+00 -2.5 -1.0 1.00e+00 1 1f 12 3.6563178e+00 0.00e+00 6.07e-01 0.00e+00 -2.5 0.4 1.00e+00 1 1f 13 2.6055509e+00 0.00e+00 3.14e-01 0.00e+00 -2.5 -0.1 5.00e-01 1 2f 14 2.4834343e+00 0.00e+00 1.06e+00 0.00e+00 -2.5 -0.6 1.25e-01 1 4f 15 1.8875275e+00 0.00e+00 2.07e-01 0.00e+00 -2.5 -0.2 1.00e+00 1 1f 16 1.4267579e+00 0.00e+00 1.09e-02 0.00e+00 -2.5 -0.6 1.00e+00 1 1f 17 1.1408856e+00 0.00e+00 5.16e-03 0.00e+00 -3.8 -1.1 1.00e+00 1 1f 18 1.0374312e+00 0.00e+00 2.16e-03 0.00e+00 -3.8 -1.6 1.00e+00 1 1f 19 1.0117429e+00 0.00e+00 9.13e-04 0.00e+00 -3.8 -2.1 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.0052444e+00 0.00e+00 7.67e-04 0.00e+00 -5.7 -2.5 1.00e+00 1 1f 21 1.0000716e+00 0.00e+00 1.25e-04 0.00e+00 -5.7 - 1.00e+00 1 1f 22 1.0000021e+00 0.00e+00 3.57e-05 0.00e+00 -5.7 - 1.00e+00 1 1f 23 1.0000000e+00 0.00e+00 1.20e-06 0.00e+00 -5.7 - 1.00e+00 1 1f 24 1.0000000e+00 0.00e+00 6.39e-11 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 24 (scaled) (unscaled) Objective...............: 1.0000000000000000e+00 1.0000000000000000e+00 Dual infeasibility......: 6.3866146952790967e-11 6.3866146952790967e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 6.3866146952790967e-11 6.3866146952790967e-11 Number of objective function evaluations = 37 Number of objective gradient evaluations = 25 Number of constraint evaluations = 37 Number of constraint Jacobian evaluations = 25 Number of Lagrangian Hessian evaluations = 24 Number of KKT factorizations = 53 Number of KKT backsolves = 33 Total wall secs in initialization = 0.003 s Total wall secs in linear solver = 0.065 s Total wall secs in NLP function evaluations = 0.007 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.021 s Total wall secs = 0.096 s EXIT: Optimal Solution Found (tol = 1.0e-08).