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 3.6348547e+04 0.00e+00 6.27e+01 0.00e+00 -1.0 - 0.00e+00 0 0 1 2.1075356e+04 0.00e+00 3.50e+01 0.00e+00 -1.0 2.0 1.00e+00 1 1f 2 1.0208547e+04 0.00e+00 1.67e+01 0.00e+00 -1.0 1.5 1.00e+00 1 1f 3 4.4073923e+03 0.00e+00 7.26e+00 0.00e+00 -1.0 1.0 1.00e+00 1 1f 4 1.7787586e+03 0.00e+00 3.05e+00 0.00e+00 -1.0 0.6 1.00e+00 1 1f 5 6.6357322e+02 0.00e+00 1.30e+00 0.00e+00 -1.0 0.1 1.00e+00 1 1f 6 1.9713384e+02 0.00e+00 4.44e-01 0.00e+00 -1.0 -0.4 1.00e+00 1 1f 7 3.9918160e+01 0.00e+00 1.42e-01 0.00e+00 -1.7 -0.9 1.00e+00 1 1f 8 1.4810903e+01 0.00e+00 6.96e-02 0.00e+00 -2.5 -0.4 1.00e+00 1 1f 9 4.8875639e+00 0.00e+00 3.01e-02 0.00e+00 -2.5 -0.9 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 1.9657850e+00 0.00e+00 1.22e-02 0.00e+00 -2.5 -1.4 1.00e+00 1 1f 11 1.2228107e+00 0.00e+00 4.73e-03 0.00e+00 -3.8 -1.9 1.00e+00 1 1f 12 1.1064103e+00 0.00e+00 3.37e-03 0.00e+00 -3.8 -1.4 1.00e+00 1 1f 13 1.0374821e+00 0.00e+00 2.21e-03 0.00e+00 -3.8 -1.9 1.00e+00 1 1f 14 1.0107092e+00 0.00e+00 1.18e-03 0.00e+00 -3.8 -2.4 1.00e+00 1 1f 15 1.0026739e+00 0.00e+00 5.32e-04 0.00e+00 -5.7 -2.9 1.00e+00 1 1f 16 1.0013275e+00 0.00e+00 3.63e-04 0.00e+00 -5.7 -2.4 1.00e+00 1 1f 17 1.0004748e+00 0.00e+00 1.92e-04 0.00e+00 -5.7 -2.9 1.00e+00 1 1f 18 1.0001305e+00 0.00e+00 7.55e-05 0.00e+00 -5.7 -3.4 1.00e+00 1 1f 19 1.0000275e+00 0.00e+00 1.94e-05 0.00e+00 -5.7 -3.9 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.0000071e+00 0.00e+00 7.17e-06 0.00e+00 -5.7 -4.4 1.00e+00 1 1f 21 1.0000020e+00 0.00e+00 9.48e-06 0.00e+00 -8.6 - 1.00e+00 1 1f 22 1.0000005e+00 0.00e+00 3.30e-06 0.00e+00 -8.6 -4.8 1.00e+00 1 1f 23 1.0000001e+00 0.00e+00 1.46e-06 0.00e+00 -8.6 - 1.00e+00 1 1f 24 1.0000000e+00 0.00e+00 9.95e-08 0.00e+00 -8.6 - 1.00e+00 1 1f 25 1.0000000e+00 0.00e+00 7.13e-11 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 25 (scaled) (unscaled) Objective...............: 1.0000000000000002e+00 1.0000000000000002e+00 Dual infeasibility......: 7.1285081402211317e-11 7.1285081402211317e-11 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 7.1285081402211317e-11 7.1285081402211317e-11 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of constraint evaluations = 26 Number of constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Number of KKT factorizations = 52 Number of KKT backsolves = 25 Total wall secs in initialization = 0.026 s Total wall secs in linear solver = 0.023 s Total wall secs in NLP function evaluations = 0.008 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.014 s Total wall secs = 0.071 s EXIT: Optimal Solution Found (tol = 1.0e-08).