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.............: 100 Total number of variables............................: 100 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.2835000e+05 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 0 0 1 2.7536124e+05 0.00e+00 1.07e+03 0.00e+00 -1.0 2.0 2.50e-01 1 3f 2 2.4058523e+05 0.00e+00 4.90e+02 0.00e+00 -1.0 2.4 1.00e+00 1 1f 3 6.8274220e+04 0.00e+00 2.50e+02 0.00e+00 -1.0 1.9 1.00e+00 1 1f 4 2.0998657e+04 0.00e+00 1.96e+02 0.00e+00 -1.0 1.5 2.50e-01 1 3f 5 6.5748265e+03 0.00e+00 6.65e+01 0.00e+00 -1.0 1.9 1.00e+00 1 1f 6 7.4083907e+02 0.00e+00 2.16e+01 0.00e+00 -1.0 1.4 1.00e+00 1 1f 7 5.8997019e+02 0.00e+00 3.58e+01 0.00e+00 -1.0 - 6.25e-02 1 5f 8 3.1844474e+02 0.00e+00 3.68e+01 0.00e+00 -1.0 - 1.00e+00 1 1f 9 1.2504712e+01 0.00e+00 7.00e+00 0.00e+00 -1.0 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 6.6520211e-02 0.00e+00 5.57e-01 0.00e+00 -1.0 - 1.00e+00 1 1f 11 3.9563341e-06 0.00e+00 4.76e-03 0.00e+00 -1.7 - 1.00e+00 1 1f 12 2.1160186e-14 0.00e+00 3.59e-07 0.00e+00 -3.8 - 1.00e+00 1 1f 13 4.3225633e-27 0.00e+00 1.41e-13 0.00e+00 -8.6 - 1.00e+00 1 1f Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 1.0915563965046804e-27 4.3225633301585342e-27 Dual infeasibility......: 1.4137443164849317e-13 5.5984274932803292e-13 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 3.5700614052649793e-14 1.4137443164849317e-13 Number of objective function evaluations = 34 Number of objective gradient evaluations = 14 Number of constraint evaluations = 34 Number of constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 13 Number of KKT factorizations = 24 Number of KKT backsolves = 25 Total wall secs in initialization = 0.012 s Total wall secs in linear solver = 0.008 s Total wall secs in NLP function evaluations = 0.002 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.008 s Total wall secs = 0.030 s EXIT: Optimal Solution Found (tol = 1.0e-08).