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.............: 10 Total number of variables............................: 4 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 1.0000000e+20 0.00e+00 1.00e+02 0.00e+00 -1.0 - 0.00e+00 0 0 1 4.7318843e+00 0.00e+00 4.64e-08 0.00e+00 -1.0 - 1.00e+00 1 1f 2 4.0873987e+00 0.00e+00 2.60e-07 0.00e+00 -8.6 - 1.25e-01 1 4f 3 3.2286726e+00 0.00e+00 1.06e-07 0.00e+00 -8.6 - 1.00e+00 1 1f 4 3.2138981e+00 0.00e+00 2.21e-07 0.00e+00 -8.6 - 1.00e+00 1 1f 5 1.9425854e+00 0.00e+00 3.49e-08 0.00e+00 -8.6 - 1.00e+00 1 1f 6 1.6001937e+00 0.00e+00 7.42e-08 0.00e+00 -8.6 - 2.50e-01 1 3f 7 1.1783896e+00 0.00e+00 4.13e-08 0.00e+00 -8.6 - 1.00e+00 1 1f 8 9.2241158e-01 0.00e+00 8.63e-08 0.00e+00 -8.6 - 1.00e+00 1 1f 9 5.9748862e-01 0.00e+00 1.59e-08 0.00e+00 -8.6 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 4.5262510e-01 0.00e+00 5.21e-08 0.00e+00 -9.0 - 5.00e-01 1 2f 11 2.8076244e-01 0.00e+00 1.99e-08 0.00e+00 -9.0 - 1.00e+00 1 1f 12 2.1139340e-01 0.00e+00 7.20e-08 0.00e+00 -9.0 - 1.00e+00 1 1f 13 8.9019501e-02 0.00e+00 4.84e-09 0.00e+00 -9.0 - 1.00e+00 1 1f Number of Iterations....: 13 (scaled) (unscaled) Objective...............: 8.9019501316377279e-10 8.9019501316377272e-02 Dual infeasibility......: 4.8447845567777257e-09 4.8447845567777253e-01 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 0.0000000000000000e+00 0.0000000000000000e+00 Overall NLP error.......: 4.8447845567777259e-17 4.8447845567777257e-09 Number of objective function evaluations = 32 Number of objective gradient evaluations = 14 Number of constraint evaluations = 32 Number of constraint Jacobian evaluations = 14 Number of Lagrangian Hessian evaluations = 13 Number of KKT factorizations = 13 Number of KKT backsolves = 25 Total wall secs in initialization = 0.010 s Total wall secs in linear solver = 0.007 s Total wall secs in NLP function evaluations = 0.003 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.007 s Total wall secs = 0.027 s EXIT: Optimal Solution Found (tol = 1.0e-08).