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.............: 300 Total number of variables............................: 1200 variables with only lower bounds: 0 variables with lower and upper bounds: 1200 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.1959927e+04 0.00e+00 1.00e+02 9.99e+00 -1.0 - 0.00e+00 1 0 1 -5.5923142e+06 0.00e+00 9.90e+01 9.79e+00 -1.0 - 1.00e+00 1 1f 2 -2.2719405e+07 0.00e+00 9.89e+01 9.78e+00 -1.0 - 1.06e-02 1 1f 3 -4.0756837e+07 0.00e+00 9.81e+01 9.71e+00 -1.0 - 1.11e-02 1 1f 4 -5.7743301e+07 0.00e+00 9.72e+01 9.62e+00 -1.0 - 1.85e-02 1 1f 5 -6.5566797e+07 0.00e+00 9.59e+01 9.49e+00 -1.0 - 2.75e-02 1 1f 6 -6.9086586e+07 0.00e+00 9.41e+01 9.31e+00 -1.0 - 4.06e-02 1 1f 7 -7.0659298e+07 0.00e+00 9.17e+01 9.07e+00 -1.0 - 5.83e-02 1 1f 8 -7.1383973e+07 0.00e+00 8.85e+01 8.75e+00 -1.0 - 8.23e-02 1 1f 9 -7.1716660e+07 0.00e+00 8.42e+01 8.33e+00 -1.0 - 1.14e-01 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 10 -7.1752321e+07 0.00e+00 6.14e+01 6.13e+00 -1.0 0.0 1.85e-01 1 1f 11 -7.1769229e+07 0.00e+00 5.41e+01 5.86e+00 -1.0 -0.5 4.77e-02 1 1f 12 -7.1935718e+07 0.00e+00 5.21e+01 5.19e+00 -1.0 - 1.80e-01 1 1f 13 -7.1965571e+07 0.00e+00 4.65e+01 4.63e+00 -1.0 - 2.70e-01 1 1f 14 -7.1976975e+07 0.00e+00 3.92e+01 3.89e+00 -1.0 - 4.14e-01 1 1f 15 -7.1981169e+07 0.00e+00 3.03e+01 3.01e+00 -1.0 - 5.25e-01 1 1f 16 -7.1983280e+07 0.00e+00 2.12e+01 2.11e+00 -1.0 - 6.33e-01 1 1f 17 -7.1984277e+07 0.00e+00 1.29e+01 1.31e+00 -1.0 - 7.36e-01 1 1f 18 -7.1984602e+07 0.00e+00 6.13e+00 6.75e-01 -1.0 - 8.32e-01 1 1f 19 -7.1984695e+07 0.00e+00 5.12e-01 1.72e-01 -1.0 - 1.00e+00 1 1f iter objective inf_pr inf_du inf_compl lg(mu) lg(rg) alpha_pr ir ls 20 -7.1996049e+07 0.00e+00 1.78e-02 3.65e-02 -1.7 - 1.00e+00 1 1f 21 -7.1998241e+07 0.00e+00 4.09e-03 1.18e-02 -2.5 - 9.20e-01 1 1f 22 -7.1998769e+07 0.00e+00 1.32e-02 2.71e-03 -3.8 - 9.23e-01 1 1f 23 -7.1998813e+07 0.00e+00 1.33e-04 4.04e-04 -3.8 - 1.00e+00 1 1f 24 -7.1998834e+07 0.00e+00 4.37e-06 8.58e-06 -5.7 - 1.00e+00 1 1f 25 -7.1998834e+07 0.00e+00 2.29e-09 6.07e-09 -8.6 - 1.00e+00 2 1f Number of Iterations....: 25 (scaled) (unscaled) Objective...............: -5.9999028663993580e+05 -7.1998834396792293e+07 Dual infeasibility......: 2.2931718191010475e-09 2.7518061829212570e-07 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 5.0576057699768748e-11 6.0691269239722496e-09 Overall NLP error.......: 6.0691269239722496e-09 6.0691269239722496e-09 Number of objective function evaluations = 26 Number of objective gradient evaluations = 26 Number of constraint evaluations = 26 Number of constraint Jacobian evaluations = 26 Number of Lagrangian Hessian evaluations = 25 Number of KKT factorizations = 30 Number of KKT backsolves = 27 Total wall secs in initialization = 0.004 s Total wall secs in linear solver = 0.037 s Total wall secs in NLP function evaluations = 0.004 s Total wall secs in solver (w/o init./fun./lin. alg.) = 0.046 s Total wall secs = 0.091 s EXIT: Optimal Solution Found (tol = 1.0e-08).