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.............: 15993 Total number of variables............................: 2000 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.3583350e+06 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 1 0 1 1.4979020e+06 0.00e+00 2.99e+01 0.00e+00 -1.0 - 1.00e+00 1 1f 2 3.2445065e+05 0.00e+00 8.99e+00 0.00e+00 -1.0 - 1.00e+00 1 1f 3 8.4406665e+04 0.00e+00 2.74e+00 0.00e+00 -1.0 - 1.00e+00 1 1f 4 3.2364349e+04 0.00e+00 9.16e-01 0.00e+00 -1.0 - 1.00e+00 1 1f 5 1.9092151e+04 0.00e+00 3.85e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 6 1.3849139e+04 0.00e+00 2.03e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 7 1.2765786e+04 0.00e+00 8.20e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 8 1.2037464e+04 0.00e+00 1.94e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 9 1.2003435e+04 0.00e+00 2.87e-02 0.00e+00 -2.5 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 1.2003285e+04 0.00e+00 1.12e-03 0.00e+00 -2.5 - 1.00e+00 1 1f 11 1.2003285e+04 0.00e+00 2.03e-06 0.00e+00 -5.7 - 1.00e+00 1 1f 12 1.2003285e+04 0.00e+00 6.87e-12 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 5.3923111374756354e+02 1.2003284592020766e+04 Dual infeasibility......: 6.8729289006561397e-12 1.5299139732860567e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.0875691377610691e-13 6.8729289006561397e-12 Number of objective function evaluations = 13 Number of objective gradient evaluations = 13 Number of constraint evaluations = 13 Number of constraint Jacobian evaluations = 13 Number of Lagrangian Hessian evaluations = 12 Number of KKT factorizations = 13 Number of KKT backsolves = 13 Total wall secs in initialization = 0.003 s Total wall secs in linear solver = 0.028 s Total wall secs in NLP function evaluations = 0.003 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.010 s Total wall secs = 0.044 s EXIT: Optimal Solution Found (tol = 1.0e-08).