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.1281737e+04 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 1 0 1 3.5154230e+04 0.00e+00 4.89e+01 0.00e+00 -1.0 2.0 1.00e+00 1 1f 2 1.4967595e+04 0.00e+00 2.13e+01 0.00e+00 -1.0 1.5 1.00e+00 1 1f 3 5.8264707e+03 0.00e+00 8.65e+00 0.00e+00 -1.0 1.0 1.00e+00 1 1f 4 2.1676878e+03 0.00e+00 3.41e+00 0.00e+00 -1.0 0.6 1.00e+00 1 1f 5 7.8105731e+02 0.00e+00 1.37e+00 0.00e+00 -1.0 0.1 1.00e+00 1 1f 6 4.0973304e+02 0.00e+00 7.57e-01 0.00e+00 -1.0 0.5 1.00e+00 1 1f 7 1.6403860e+02 0.00e+00 3.32e-01 0.00e+00 -1.7 0.0 1.00e+00 1 1f 8 4.7259729e+01 0.00e+00 1.27e-01 0.00e+00 -1.7 -0.4 1.00e+00 1 1f 9 1.1608447e+01 0.00e+00 4.80e-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 3.2913917e+00 0.00e+00 1.77e-02 0.00e+00 -2.5 -1.4 1.00e+00 1 1f 11 2.0018427e+00 0.00e+00 1.09e-02 0.00e+00 -3.8 -1.0 1.00e+00 1 1f 12 1.3305270e+00 0.00e+00 6.22e-03 0.00e+00 -3.8 -1.4 1.00e+00 1 1f 13 1.0908023e+00 0.00e+00 3.49e-03 0.00e+00 -3.8 -1.9 1.00e+00 1 1f 14 1.0222741e+00 0.00e+00 1.66e-03 0.00e+00 -3.8 -2.4 1.00e+00 1 1f 15 1.0107587e+00 0.00e+00 1.17e-03 0.00e+00 -3.8 -2.0 1.00e+00 1 1f 16 1.0038070e+00 0.00e+00 6.61e-04 0.00e+00 -5.7 -2.4 1.00e+00 1 1f 17 1.0010695e+00 0.00e+00 2.94e-04 0.00e+00 -5.7 -2.9 1.00e+00 1 1f 18 1.0005930e+00 0.00e+00 2.00e-04 0.00e+00 -5.7 -2.5 1.00e+00 1 1f 19 1.0002307e+00 0.00e+00 9.98e-05 0.00e+00 -5.7 -3.0 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 1.0000662e+00 0.00e+00 4.08e-05 0.00e+00 -5.7 -3.5 1.00e+00 1 1f 21 1.0000157e+00 0.00e+00 1.21e-05 0.00e+00 -5.7 -3.9 1.00e+00 1 1f 22 1.0000045e+00 0.00e+00 4.34e-06 0.00e+00 -8.6 -4.4 1.00e+00 1 1f 23 1.0000020e+00 0.00e+00 9.16e-06 0.00e+00 -8.6 - 1.00e+00 1 1f 24 1.0000009e+00 0.00e+00 4.73e-06 0.00e+00 -8.6 -4.0 1.00e+00 1 1f 25 1.0000003e+00 0.00e+00 2.06e-06 0.00e+00 -8.6 -4.5 1.00e+00 1 1f 26 1.0000000e+00 0.00e+00 8.10e-07 0.00e+00 -8.6 - 1.00e+00 1 1f 27 1.0000000e+00 0.00e+00 9.85e-08 0.00e+00 -8.6 - 1.00e+00 1 1f 28 1.0000000e+00 0.00e+00 6.17e-10 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 28 (scaled) (unscaled) Objective...............: 7.9354694360383915e-01 1.0000000000000184e+00 Dual infeasibility......: 6.1677823629242567e-10 7.7724228070412687e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.8944248429121181e-10 6.1677823629242567e-10 Number of objective function evaluations = 29 Number of objective gradient evaluations = 29 Number of constraint evaluations = 29 Number of constraint Jacobian evaluations = 29 Number of Lagrangian Hessian evaluations = 28 Number of KKT factorizations = 61 Number of KKT backsolves = 29 Total wall secs in initialization = 0.006 s Total wall secs in linear solver = 0.074 s Total wall secs in NLP function evaluations = 0.007 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.024 s Total wall secs = 0.110 s EXIT: Optimal Solution Found (tol = 1.0e-08).