This is MadNLP version v0.12.0, running with cuDSS v1.0.0 Number of nonzeros in constraint Jacobian............: 3 Number of nonzeros in Lagrangian Hessian.............: 6 Total number of variables............................: 3 variables with only lower bounds: 0 variables with lower and upper bounds: 3 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 1 inequality constraints with only lower bounds: 1 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 -1.0000000e+03 0.00e+00 1.00e+02 3.20e+01 -1.0 - 0.00e+00 0 0 1 -1.0501248e+03 2.92e-07 5.19e+01 1.59e+00 -1.0 2.0 1.00e+00 1 1f 2 -1.2075259e+03 3.35e-08 5.79e+01 2.09e-01 -1.0 1.5 1.00e+00 1 1f 3 -1.8600260e+03 1.16e-07 7.85e+01 1.12e-01 -1.0 1.0 1.00e+00 1 1f 4 -1.8907800e+03 1.20e-07 7.94e+01 5.02e-01 -1.0 0.6 3.76e-03 1 1f 5 -2.9165483e+03 1.18e-07 9.77e+01 1.51e-01 -1.0 1.0 8.75e-01 1 1f 6 -2.9309426e+03 1.19e-07 2.98e+02 1.67e+00 -1.0 0.5 1.87e-03 1 1f 7 -3.2961332e+03 1.19e-07 5.00e+02 9.08e-01 -1.0 - 4.46e-03 1 1f 8 -3.2997016e+03 5.16e-15 3.32e-07 1.62e-01 -1.0 - 1.00e+00 1 1f 9 -3.2999914e+03 3.56e-15 3.14e-06 2.98e-03 -2.5 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -3.2999996e+03 5.34e-15 2.32e-09 1.50e-04 -3.8 - 1.00e+00 1 1f 11 -3.3000000e+03 8.27e-15 6.85e-12 1.85e-06 -5.7 - 1.00e+00 2 1f 12 -3.3000000e+03 5.40e-15 2.84e-14 2.51e-09 -8.6 - 1.00e+00 2 1f Number of Iterations....: 12 (scaled) (unscaled) Objective...............: -3.3000000208924816e+03 -3.3000000208924816e+03 Dual infeasibility......: 2.8421709430404007e-14 2.8421709430404007e-14 Constraint violation....: 5.3961037163384441e-15 5.3961037163384441e-15 Complementarity.........: 2.5059952834078446e-09 2.5059952834078446e-09 Overall NLP error.......: 2.5059952834078446e-09 2.5059952834078446e-09 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 = 22 Number of KKT backsolves = 14 Total wall secs in initialization = 0.021 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.019 s Total wall secs = 0.049 s EXIT: Optimal Solution Found (tol = 1.0e-08).