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.............: 20000 Total number of variables............................: 5000 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 2.9250000e+06 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 0 0 1 2.2450483e+05 0.00e+00 8.82e+00 0.00e+00 -1.0 - 1.00e+00 1 1f 2 6.2033258e+04 0.00e+00 4.95e-01 0.00e+00 -1.0 - 1.00e+00 1 1f 3 2.2938270e+04 0.00e+00 1.67e+00 0.00e+00 -1.7 - 1.00e+00 1 1f 4 9.6394462e+03 0.00e+00 1.55e+00 0.00e+00 -1.7 - 1.00e+00 1 1f 5 3.9816639e+03 0.00e+00 1.35e+00 0.00e+00 -1.7 - 1.00e+00 1 1f 6 1.3733423e+03 0.00e+00 9.07e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 7 3.2569513e+02 0.00e+00 5.10e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 8 3.7186169e+01 0.00e+00 1.85e-01 0.00e+00 -1.7 - 1.00e+00 1 1f 9 9.3154165e-01 0.00e+00 3.26e-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 8.5245508e-04 0.00e+00 9.78e-04 0.00e+00 -2.5 - 1.00e+00 1 1f 11 7.7287845e-10 0.00e+00 9.58e-07 0.00e+00 -5.7 - 1.00e+00 1 1f 12 6.3807755e-22 0.00e+00 8.48e-13 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 12 (scaled) (unscaled) Objective...............: 1.3314752283507123e-25 6.3807754778159845e-22 Dual infeasibility......: 8.4765729251387914e-13 4.0621941366225623e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 1.7688048906233785e-16 8.4765729251387914e-13 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 = 12 Number of KKT backsolves = 12 Total wall secs in initialization = 0.028 s Total wall secs in linear solver = 0.005 s Total wall secs in NLP function evaluations = 0.002 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.021 s Total wall secs = 0.057 s EXIT: Optimal Solution Found (tol = 1.0e-08).