na = 5 nb = 3 nc = 3 nd = 2 ne = 2 360 variables, all nonlinear 180 constraints, all linear; 360 nonzeros 180 equality constraints 1 nonlinear objective; 360 nonzeros. SNOPT 7.2-5 : summary_file=6 print_file=9 scale=no print_level=0 major_iterations=2000 iterations=50000 optimality_tol=1e-7 *penalty=100.0 superbasics_limit=3000 solution=yes *verify_level=3 SNMEMB EXIT 100 -- finished successfully SNMEMB INFO 104 -- memory requirements estimated Nonlinear constraints 0 Linear constraints 181 Nonlinear variables 360 Linear variables 0 Jacobian variables 0 Objective variables 360 Total constraints 181 Total variables 360 The user has defined 360 out of 360 objective gradients. Major Minors Step nObj Feasible Optimal Objective nS 0 99 1 2.2E-01 3.9592651E+02 99 r T 1 81 4.0E-01 2 1.5E-01 3.9941933E+02 179 n rl 2 1 4.0E-01 3 2.4E-01 4.0180096E+02 179 s l 3 1 1.0E+00 4 3.0E-01 4.1231699E+02 179 4 1 4.7E-01 6 1.8E-01 4.1384586E+02 179 5 1 1.0E+00 7 1.3E-01 4.1522904E+02 179 6 1 1.0E+00 8 7.8E-02 4.1628228E+02 179 7 1 1.0E+00 9 6.0E-02 4.1678204E+02 179 8 1 1.0E+00 10 2.9E-02 4.1708994E+02 179 9 1 1.0E+00 11 1.7E-02 4.1725511E+02 179 Major Minors Step nObj Feasible Optimal Objective nS 10 1 1.0E+00 12 1.7E-02 4.1734865E+02 179 11 1 1.0E+00 13 1.9E-02 4.1739315E+02 179 12 1 1.0E+00 14 2.2E-02 4.1742106E+02 179 R 13 1 1.0E+00 15 8.8E-03 4.1743424E+02 179 s 14 1 1.0E+00 16 3.2E-03 4.1744375E+02 179 15 1 1.0E+00 17 2.7E-03 4.1744866E+02 179 16 1 1.0E+00 18 4.7E-03 4.1745200E+02 179 17 1 1.0E+00 19 7.6E-03 4.1745338E+02 179 18 1 1.0E+00 20 2.0E-03 4.1745435E+02 179 19 1 1.0E+00 21 3.1E-03 4.1745474E+02 179 Major Minors Step nObj Feasible Optimal Objective nS 20 1 1.0E+00 22 8.5E-04 4.1745496E+02 179 21 1 1.0E+00 23 9.7E-04 4.1745510E+02 179 22 1 1.0E+00 24 9.4E-04 4.1745518E+02 179 23 1 1.0E+00 25 4.5E-04 4.1745521E+02 179 R 24 1 1.0E+00 26 2.8E-04 4.1745521E+02 179 s 25 1 1.0E+00 27 1.2E-04 4.1745522E+02 179 26 1 1.0E+00 28 1.2E-04 4.1745522E+02 179 27 1 1.0E+00 29 8.9E-05 4.1745522E+02 179 28 1 1.0E+00 30 6.0E-05 4.1745522E+02 179 29 1 1.0E+00 31 1.3E-05 4.1745522E+02 179 Major Minors Step nObj Feasible Optimal Objective nS 30 1 1.0E+00 32 1.7E-05 4.1745522E+02 179 31 1 1.0E+00 33 9.5E-06 4.1745522E+02 179 32 1 1.0E+00 34 7.0E-06 4.1745522E+02 179 33 1 1.0E+00 35 3.8E-06 4.1745522E+02 179 34 1 1.0E+00 36 3.4E-06 4.1745522E+02 179 R 35 1 1.0E+00 37 1.1E-06 4.1745522E+02 179 s 36 1 1.0E+00 38 1.8E-06 4.1745522E+02 179 37 1 1.0E+00 39 7.3E-07 4.1745522E+02 179 38 1 1.0E+00 40 7.4E-07 4.1745522E+02 179 39 1 1.0E+00 41 3.8E-07 4.1745522E+02 179 Major Minors Step nObj Feasible Optimal Objective nS 40 1 1.0E+00 42 2.8E-07 4.1745522E+02 179 41 1 1.0E+00 43 3.1E-07 4.1745522E+02 179 42 1 1.0E+00 44 (9.3E-08) 4.1745522E+02 179 SNOPTB EXIT 0 -- finished successfully SNOPTB INFO 1 -- optimality conditions satisfied Problem name at57656 No. of iterations 221 Objective value 4.1745522285E+02 No. of major iterations 42 Linear objective 0.0000000000E+00 Penalty parameter 0.000E+00 Nonlinear objective 4.1745522285E+02 No. of calls to funobj 45 No. of calls to funcon 0 No. of superbasics 179 No. of basic nonlinears 180 No. of degenerate steps 0 Percentage .00 Max x 154 1.3E+01 Max pi 35 1.1E+00 Max Primal infeas 0 0.0E+00 Max Dual infeas 207 1.9E-07 Solution printed on file 9 Time for MPS input .00 seconds Time for solving problem .03 seconds Time for solution output .02 seconds Time for constraint functions .00 seconds Time for objective function .00 seconds SNOPT 7.2-5 : Optimal solution found. 221 iterations, objective 417.4552228 Nonlin evals: obj = 45, grad = 44. na = 5 nb = 3 nc = 3 nd = 2 ne = 2 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 1 kmax = 20 rhok = 100 etak = 0.01 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1745518e+02 0.00e+00 2.16e+00 -1.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -1.3492270e+01 0.00e+00 6.99e+00 -1.0 1.31e+00 - 7.90e-01 8.08e-01f 1 2 -7.3618114e+01 0.00e+00 4.56e+00 -1.0 6.11e-01 0.0 4.78e-01 4.09e-01f 1 3 -7.9070196e+01 0.00e+00 4.19e+00 -1.0 4.93e+00 -0.5 5.25e-02 4.46e-02f 1 4 -1.0808141e+02 0.00e+00 3.05e+00 -1.0 8.27e-01 -0.1 3.61e-01 3.26e-01f 1 5 -1.0886697e+02 0.00e+00 3.07e+00 -1.0 3.08e+01 -0.5 6.55e-03 6.22e-03f 1 6 -1.2796863e+02 0.00e+00 4.39e+00 -1.0 1.21e+00 -0.1 2.35e-01 3.27e-01f 1 7 -1.3071967e+02 0.00e+00 4.20e+00 -1.0 1.90e+00 -0.6 9.39e-02 6.07e-02f 1 8 -1.3616102e+02 0.00e+00 3.69e+00 -1.0 1.25e+00 -0.2 1.57e-01 1.48e-01f 1 9 -1.5077938e+02 0.00e+00 2.70e+00 -1.0 5.07e-01 0.3 6.02e-01 4.82e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -1.6743344e+02 0.00e+00 9.69e-01 -1.0 2.00e-01 0.7 1.00e+00 1.00e+00f 1 11 -3.4264248e+02 0.00e+00 3.27e+00 -1.7 1.80e-01 0.2 6.76e-01 1.00e+00f 1 12 -3.5513689e+02 0.00e+00 3.17e+00 -1.7 4.68e+01 - 2.01e-01 4.56e-01f 1 13 -3.6072859e+02 0.00e+00 2.46e+00 -1.7 5.86e+01 - 3.31e-01 4.93e-01f 1 14 -3.5747523e+02 0.00e+00 2.11e+00 -1.7 7.91e+01 - 3.19e-01 6.88e-01f 1 15 -3.4668364e+02 9.51e-03 2.86e+00 -1.7 9.89e+01 - 1.88e-01 7.19e-01f 1 16 -3.3875632e+02 2.61e-03 2.51e+00 -1.7 9.40e+01 - 2.81e-01 5.16e-01f 1 17 -3.3801819e+02 1.43e-03 2.31e+00 -1.7 1.02e+02 - 1.10e-01 4.37e-02h 1 18 -3.3687269e+02 0.00e+00 2.14e+00 -1.7 1.07e+02 - 9.78e-02 6.21e-02h 1 19 -3.3930934e+02 0.00e+00 3.62e-01 -1.7 2.32e-01 -0.3 7.88e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -3.3980941e+02 0.00e+00 8.52e-02 -1.7 6.28e-02 0.2 1.00e+00 1.00e+00h 1 21 -3.5647301e+02 0.00e+00 9.48e-01 -2.5 1.69e-01 -0.3 4.41e-01 6.83e-01f 1 22 -3.6441934e+02 0.00e+00 7.99e-01 -2.5 1.06e+02 - 2.95e-01 3.59e-01f 1 23 -3.6446475e+02 0.00e+00 5.66e-01 -2.5 7.99e+02 - 8.13e-05 2.59e-04h 2 24 -3.6763159e+02 0.00e+00 4.56e-01 -2.5 1.10e-01 -0.8 3.98e-01 4.71e-01h 1 25 -3.7505236e+02 0.00e+00 1.07e+00 -2.5 8.86e+01 - 4.45e-02 4.73e-01f 1 26 -3.7818646e+02 0.00e+00 7.45e-01 -2.5 6.37e+01 - 3.07e-01 3.10e-01h 1 27 -3.8587554e+02 0.00e+00 1.14e+00 -2.5 5.16e+01 - 4.82e-01 1.00e+00h 1 28 -3.8790466e+02 0.00e+00 8.54e-01 -2.5 8.48e+00 - 5.72e-01 9.64e-01h 1 29 -3.8829851e+02 0.00e+00 3.84e-01 -2.5 1.11e+00 - 7.10e-01 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -3.8817051e+02 0.00e+00 6.01e-01 -2.5 5.77e-01 - 3.71e-01 1.00e+00h 1 31 -3.8812564e+02 0.00e+00 6.11e-03 -2.5 1.51e-01 - 1.00e+00 1.00e+00h 1 32 -3.9083564e+02 0.00e+00 4.98e-01 -3.8 1.04e-01 -1.3 5.65e-01 1.00e+00f 1 33 -3.9323373e+02 0.00e+00 4.65e-01 -3.8 1.38e+02 - 5.54e-02 4.19e-02f 1 34 -3.9522702e+02 7.91e-04 4.45e-01 -3.8 1.18e+02 - 4.14e-02 3.92e-02f 1 35 -3.9864350e+02 5.36e-03 4.10e-01 -3.8 1.02e+02 - 7.93e-02 7.98e-02f 1 36 -3.9982256e+02 5.43e-03 3.80e-01 -3.8 7.95e+01 - 1.13e-01 3.32e-02h 1 37 -4.0159995e+02 4.24e-03 3.64e-01 -3.8 7.35e+01 - 8.97e-02 5.74e-02h 1 38 -4.0503652e+02 4.03e-03 3.10e-01 -3.8 6.37e+01 - 7.13e-02 1.27e-01h 1 39 -4.0594146e+02 4.13e-03 3.00e-01 -3.8 4.58e+01 - 7.77e-02 3.80e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -4.0750474e+02 4.40e-03 2.80e-01 -3.8 4.20e+01 - 4.50e-02 7.55e-02h 1 41 -4.0844882e+02 4.68e-03 2.65e-01 -3.8 3.46e+01 - 5.42e-02 5.02e-02h 1 42 -4.0876444e+02 4.68e-03 2.60e-01 -3.8 3.11e+01 - 1.95e-02 1.81e-02h 1 43 -4.0972061e+02 4.77e-03 2.44e-01 -3.8 2.99e+01 - 6.04e-02 5.76e-02h 1 44 -4.1030670e+02 4.71e-03 2.32e-01 -3.8 2.76e+01 - 8.65e-02 4.22e-02h 1 45 -4.1155684e+02 4.47e-03 2.09e-01 -3.8 2.60e+01 - 6.17e-02 9.98e-02h 1 46 -4.1235118e+02 4.22e-03 1.93e-01 -3.8 2.19e+01 - 4.87e-02 7.49e-02h 1 47 -4.1312288e+02 3.96e-03 2.39e-01 -3.8 1.95e+01 - 2.59e-02 8.24e-02h 1 48 -4.1359899e+02 3.76e-03 1.67e-01 -3.8 1.72e+01 - 1.12e-01 5.73e-02h 1 49 -4.1431462e+02 3.48e-03 1.69e-01 -3.8 1.60e+01 - 5.96e-02 9.60e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -4.1450598e+02 5.36e-03 5.69e-01 -3.8 1.38e+00 -1.7 2.98e-02 1.18e-01h 1 51 -4.1494228e+02 5.38e-03 6.17e-01 -3.8 1.37e+01 - 2.33e-02 6.19e-02h 1 52 -4.1539246e+02 4.98e-03 5.67e-01 -3.8 1.22e+01 - 9.46e-02 7.14e-02h 1 53 -4.1580929e+02 4.56e-03 5.28e-01 -3.8 1.12e+01 - 3.86e-02 7.66e-02h 1 54 -4.1604873e+02 4.31e-03 5.05e-01 -3.8 1.00e+01 - 2.40e-02 4.72e-02h 1 55 -4.1625928e+02 4.08e-03 4.81e-01 -3.8 9.63e+00 - 5.13e-02 4.70e-02h 1 56 -4.1650426e+02 3.80e-03 4.49e-01 -3.8 9.10e+00 - 1.19e-01 5.92e-02h 1 57 -4.1714079e+02 3.04e-03 3.77e-01 -3.8 8.45e+00 - 7.20e-02 1.72e-01h 1 58 -4.1732857e+02 2.80e-03 3.49e-01 -3.8 6.67e+00 - 1.56e-01 6.28e-02h 1 59 -4.1762851e+02 2.42e-03 3.15e-01 -3.8 6.13e+00 - 2.87e-02 1.07e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 60 -4.1788048e+02 2.09e-03 2.82e-01 -3.8 5.39e+00 - 1.25e-01 1.04e-01h 1 61 -4.1827184e+02 1.87e-03 2.30e-01 -3.8 4.77e+00 - 1.68e-01 1.87e-01h 1 62 -4.1843156e+02 1.67e-03 2.06e-01 -3.8 3.77e+00 - 1.49e-01 9.53e-02h 1 63 -4.1860055e+02 1.56e-03 1.86e-01 -3.8 3.31e+00 - 4.28e-02 1.09e-01h 1 64 -4.1881066e+02 1.50e-03 1.59e-01 -3.8 2.90e+00 - 1.06e-01 1.50e-01h 1 65 -4.1893023e+02 1.96e-03 1.77e-01 -3.8 2.61e+00 - 8.37e-02 9.45e-02h 1 66 -4.1895017e+02 2.17e-03 2.57e-01 -3.8 3.05e+00 -2.2 7.87e-03 1.69e-02h 1 67 -4.1900653e+02 2.50e-03 6.25e-01 -3.8 8.16e-01 -1.8 1.67e-02 9.62e-02h 1 68 -4.1902044e+02 2.49e-03 6.20e-01 -3.8 2.59e+00 - 1.54e-02 7.31e-03h 1 69 -4.1906897e+02 2.55e-03 6.03e-01 -3.8 2.47e+00 - 2.07e-02 2.82e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 70 -4.1935312e+02 1.73e-03 4.14e-01 -3.8 2.14e+00 - 1.69e-01 3.12e-01h 1 71 -4.1944027e+02 1.44e-03 3.55e-01 -3.8 1.45e+00 - 6.69e-02 1.40e-01h 1 72 -4.1952424e+02 1.47e-03 3.43e-01 -3.8 1.23e+00 - 1.11e-01 1.59e-01h 1 73 -4.1965067e+02 7.19e-04 3.89e-01 -3.8 1.09e+00 - 2.25e-01 3.49e-01h 1 74 -4.1983463e+02 1.27e-04 8.01e-01 -3.8 6.53e-01 - 2.41e-01 9.62e-01h 1 75 -4.1985792e+02 0.00e+00 5.86e-01 -3.8 1.34e-01 - 2.80e-01 8.06e-01h 1 76 -4.1987113e+02 0.00e+00 4.14e-01 -3.8 6.80e-02 - 3.70e-01 9.74e-01h 1 77 -4.1987647e+02 0.00e+00 2.25e-01 -3.8 9.01e-02 - 3.51e-01 4.46e-01f 1 78 -4.1988113e+02 0.00e+00 1.55e-01 -3.8 9.13e-02 - 3.03e-01 5.08e-01f 1 79 -4.1988629e+02 0.00e+00 1.23e-01 -3.8 1.51e-01 - 2.28e-01 4.10e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 80 -4.1988719e+02 0.00e+00 1.64e-01 -3.8 2.72e-02 - 6.55e-01 1.00e+00f 1 81 -4.1989030e+02 0.00e+00 5.43e-02 -3.8 6.75e-02 - 6.85e-01 6.67e-01h 1 82 -4.1988999e+02 0.00e+00 1.83e-04 -3.8 6.97e-03 - 1.00e+00 1.00e+00f 1 83 -4.2011782e+02 1.64e-06 3.96e-03 -5.7 2.73e+00 - 3.97e-01 3.92e-01f 1 84 -4.2019773e+02 1.19e-04 2.35e-02 -5.7 1.66e+00 - 3.58e-01 2.54e-01h 1 85 -4.2027324e+02 2.42e-04 2.99e-02 -5.7 1.25e+00 - 4.64e-01 3.60e-01h 1 86 -4.2031994e+02 2.42e-04 2.41e-02 -5.7 8.06e-01 - 4.56e-01 3.96e-01h 1 87 -4.2035285e+02 1.72e-04 9.44e-03 -5.7 4.88e-01 - 4.32e-01 5.33e-01h 1 88 -4.2037254e+02 5.40e-05 5.37e-03 -5.7 2.28e-01 - 8.96e-01 7.90e-01h 1 89 -4.2037743e+02 0.00e+00 1.64e-05 -5.7 5.21e-02 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 90 -4.2037755e+02 0.00e+00 2.16e-07 -5.7 3.22e-03 - 1.00e+00 1.00e+00h 1 91 -4.2038037e+02 0.00e+00 5.58e-04 -8.6 3.36e-02 - 9.45e-01 8.88e-01h 1 92 -4.2038073e+02 2.66e-08 1.10e-04 -8.6 6.23e-03 - 1.00e+00 9.73e-01h 1 93 -4.2038074e+02 0.00e+00 4.20e-08 -8.6 1.22e-03 - 1.00e+00 1.00e+00h 1 94 -4.2038074e+02 0.00e+00 8.42e-09 -8.6 6.02e-04 - 1.00e+00 1.00e+00h 1 95 -4.2038075e+02 0.00e+00 2.83e-09 -9.0 3.61e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 95 (scaled) (unscaled) Objective...............: -4.2038074713596779e+02 -4.2038074713596779e+02 Dual infeasibility......: 2.8291287539065082e-09 2.8291287539065082e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 3.1604059742702478e-09 3.1604059742702478e-09 Overall NLP error.......: 3.1604059742702478e-09 3.1604059742702478e-09 Number of objective function evaluations = 98 Number of objective gradient evaluations = 96 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 98 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 96 Number of Lagrangian Hessian evaluations = 95 Total CPU secs in IPOPT (w/o function evaluations) = 27.354 Total CPU secs in NLP function evaluations = 12.932 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found suffix ipopt_zU_out OUT; suffix ipopt_zL_out OUT; na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 1 rhok = 100 etak = 0.01 kmax = 20 K = 1 kmax = 20 rmax = 0.0069537 rmin = 6.6052e-14 K = 1 etak = 0.01 etak = 0.001 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 2 kmax = 20 rhok = 100 etak = 0.001 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1982315e+02 0.00e+00 1.00e+00 -4.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1997346e+02 2.10e-03 1.46e-01 -4.0 7.38e-01 - 9.89e-01 7.91e-01h 1 2 -4.1995163e+02 1.68e-03 1.18e-01 -4.0 1.82e+00 - 1.62e-01 1.89e-01H 1 3 -4.1988558e+02 9.56e-04 5.64e-02 -4.0 1.35e+00 - 6.19e-01 5.22e-01H 1 4 -4.1978039e+02 1.03e-05 1.60e-03 -4.0 7.40e-01 - 9.92e-01 1.00e+00h 1 5 -4.1977765e+02 0.00e+00 1.46e-04 -4.0 9.24e-02 - 1.00e+00 1.00e+00h 1 6 -4.1988773e+02 4.19e-05 4.36e-03 -6.0 1.98e+00 - 3.92e-01 3.77e-01f 1 7 -4.1994365e+02 3.36e-04 7.98e-03 -6.0 1.22e+00 - 3.76e-01 3.50e-01h 1 8 -4.1997240e+02 3.49e-04 2.02e-02 -6.0 1.04e+00 - 3.99e-01 3.04e-01h 1 9 -4.1999302e+02 3.13e-04 1.84e-02 -6.0 7.82e-01 - 4.02e-01 3.42e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.2001314e+02 1.77e-04 1.23e-02 -6.0 3.27e-01 - 6.26e-01 5.66e-01h 1 11 -4.2002291e+02 5.92e-05 1.85e-02 -6.0 1.33e-01 - 1.00e+00 6.82e-01h 1 12 -4.2002740e+02 2.77e-06 3.63e-05 -6.0 4.65e-02 - 1.00e+00 1.00e+00h 1 13 -4.2002751e+02 0.00e+00 5.18e-07 -6.0 3.84e-03 - 1.00e+00 1.00e+00h 1 14 -4.2002883e+02 1.42e-07 2.79e-04 -9.0 1.69e-02 - 9.51e-01 9.08e-01h 1 15 -4.2002898e+02 1.18e-08 4.52e-05 -9.0 1.83e-03 - 1.00e+00 9.85e-01h 1 16 -4.2002898e+02 6.24e-10 3.40e-08 -9.0 8.03e-04 - 1.00e+00 1.00e+00f 1 17 -4.2002898e+02 0.00e+00 3.72e-09 -9.0 2.32e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 17 (scaled) (unscaled) Objective...............: -4.2002898491104230e+02 -4.2002898491104230e+02 Dual infeasibility......: 3.7193978885519485e-09 3.7193978885519485e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 5.4055995388624923e-09 5.4055995388624923e-09 Overall NLP error.......: 5.4055995388624923e-09 5.4055995388624923e-09 Number of objective function evaluations = 20 Number of objective gradient evaluations = 18 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 20 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 18 Number of Lagrangian Hessian evaluations = 17 Total CPU secs in IPOPT (w/o function evaluations) = 4.633 Total CPU secs in NLP function evaluations = 2.470 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 2 rhok = 100 etak = 0.001 kmax = 20 K = 2 kmax = 20 rmax = 0.00409431 rmin = -0.00183903 K = 2 rhok = 100 rhok = 1000 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 3 kmax = 20 rhok = 1000 etak = 0.001 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1999672e+02 6.55e-03 3.68e+00 -4.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1997477e+02 2.47e-03 9.72e-01 -4.0 9.57e-01 - 6.48e-01 7.36e-01h 1 2 -4.1991178e+02 1.75e-03 1.14e+00 -4.0 6.85e-01 - 6.45e-01 3.77e-01h 1 3 -4.1987237e+02 1.54e-03 4.39e-01 -4.0 8.92e-01 - 5.14e-01 2.75e-01h 1 4 -4.1982001e+02 9.19e-04 5.41e-01 -4.0 9.30e-01 - 9.42e-01 3.77e-01h 1 5 -4.1970009e+02 1.50e-04 8.11e-02 -4.0 1.12e+00 - 9.50e-01 8.62e-01h 1 6 -4.1965763e+02 0.00e+00 7.90e-04 -4.0 2.03e-01 - 1.00e+00 1.00e+00h 1 7 -4.1971201e+02 0.00e+00 9.42e-02 -6.0 2.00e+00 - 3.01e-01 2.06e-01h 1 8 -4.1977542e+02 2.37e-04 6.02e-02 -6.0 1.60e+00 - 2.86e-01 3.53e-01h 1 9 -4.1980805e+02 2.63e-04 8.08e-02 -6.0 1.03e+00 - 2.59e-01 3.26e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1982605e+02 1.98e-04 2.84e-02 -6.0 7.08e-01 - 3.55e-01 3.01e-01h 1 11 -4.1984009e+02 1.30e-04 1.81e-02 -6.0 5.01e-01 - 4.15e-01 3.75e-01h 1 12 -4.1984779e+02 8.65e-05 6.92e-02 -6.0 3.12e-01 - 6.39e-01 3.65e-01h 1 13 -4.1985455e+02 4.08e-05 7.50e-02 -6.0 1.99e-01 - 9.85e-01 5.53e-01h 1 14 -4.1985926e+02 7.76e-06 5.35e-03 -6.0 8.92e-02 - 1.00e+00 9.42e-01h 1 15 -4.1985965e+02 0.00e+00 5.09e-06 -6.0 6.34e-03 - 1.00e+00 1.00e+00h 1 16 -4.1986051e+02 1.80e-07 2.83e-03 -9.0 2.07e-02 - 9.67e-01 8.45e-01h 1 17 -4.1986067e+02 3.05e-08 4.45e-04 -9.0 3.76e-03 - 1.00e+00 9.57e-01h 1 18 -4.1986068e+02 8.32e-10 8.87e-08 -9.0 8.15e-04 - 1.00e+00 1.00e+00h 1 19 -4.1986069e+02 0.00e+00 1.09e-08 -9.0 3.05e-04 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1986069e+02 0.00e+00 2.31e-09 -9.0 1.25e-04 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 20 (scaled) (unscaled) Objective...............: -4.1986068515138908e+02 -4.1986068515138908e+02 Dual infeasibility......: 2.3129599184400067e-09 2.3129599184400067e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.9958115886446561e-09 1.9958115886446561e-09 Overall NLP error.......: 2.3129599184400067e-09 2.3129599184400067e-09 Number of objective function evaluations = 21 Number of objective gradient evaluations = 21 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 21 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 21 Number of Lagrangian Hessian evaluations = 20 Total CPU secs in IPOPT (w/o function evaluations) = 5.109 Total CPU secs in NLP function evaluations = 2.774 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 3 rhok = 1000 etak = 0.001 kmax = 20 K = 3 kmax = 20 rmax = 0.00134474 rmin = -0.000567563 K = 3 rhok = 1000 rhok = 10000 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 4 kmax = 20 rhok = 10000 etak = 0.001 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1984240e+02 6.86e-03 1.21e+01 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.2001495e+02 5.77e-03 9.66e+00 -5.0 1.75e+00 - 1.50e-01 2.02e-01h 1 2 -4.2001848e+02 5.76e-03 9.64e+00 -5.0 1.17e+02 -4.0 5.11e-03 1.75e-03h 1 3 -4.2002089e+02 5.74e-03 9.59e+00 -5.0 1.05e+00 - 6.41e-01 5.02e-03h 1 4 -4.2027519e+02 4.13e-03 4.44e+00 -5.0 9.79e-02 -1.8 9.79e-01 5.37e-01h 1 5 -4.2025059e+02 3.23e-03 2.89e+00 -5.0 6.66e-02 -1.3 9.94e-01 3.49e-01h 1 6 -4.2016282e+02 2.61e-03 2.34e+00 -5.0 1.81e-01 -1.8 7.07e-02 1.89e-01h 1 7 -4.2009901e+02 2.11e-03 1.87e+00 -5.0 1.06e-01 -1.4 1.92e-01 2.02e-01h 1 8 -4.2004148e+02 1.77e-03 1.59e+00 -5.0 2.06e-01 -1.9 9.14e-02 1.51e-01h 1 9 -4.2001703e+02 1.62e-03 1.45e+00 -5.0 1.03e-01 -1.4 2.01e-01 8.65e-02h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1997695e+02 1.40e-03 1.27e+00 -5.0 3.50e-01 -1.9 1.63e-01 1.24e-01h 1 11 -4.1995013e+02 1.26e-03 1.15e+00 -5.0 2.19e-01 -2.4 2.64e-01 9.13e-02h 1 12 -4.1989262e+02 9.64e-04 9.05e-01 -5.0 3.98e-01 -2.9 5.98e-02 2.16e-01h 1 13 -4.1984305e+02 7.09e-04 6.88e-01 -5.0 2.67e-01 -2.4 1.05e-01 2.40e-01h 1 14 -4.1981900e+02 5.73e-04 1.78e+00 -5.0 2.98e-02 -1.1 8.82e-01 1.95e-01h 1 15 -4.1979050e+02 4.53e-04 1.38e+00 -5.0 9.29e-02 -1.6 5.90e-01 1.92e-01h 1 16 -4.1974565e+02 2.85e-04 1.27e+00 -5.0 3.48e-02 -1.2 9.88e-01 3.89e-01h 1 17 -4.1974107e+02 3.38e-04 1.42e+00 -5.0 3.91e-01 -1.6 9.15e-02 5.75e-02h 2 18 -4.1970370e+02 2.17e-04 7.28e-01 -5.0 3.66e-02 -1.2 9.93e-01 4.56e-01h 1 19 -4.1969159e+02 1.79e-04 5.10e-01 -5.0 7.16e-02 -1.7 2.19e-01 3.05e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1969095e+02 1.71e-04 5.31e-01 -5.0 2.53e-01 -2.2 1.93e-01 4.72e-02h 1 21 -4.1969089e+02 1.43e-04 4.24e-01 -5.0 2.74e-01 -2.7 2.10e-01 2.05e-01H 1 22 -4.1969244e+02 1.30e-04 4.69e-01 -5.0 5.67e-01 -3.1 9.06e-02 7.62e-02h 1 23 -4.1969632e+02 1.15e-04 6.20e-01 -5.0 1.98e+00 -3.6 1.72e-01 1.01e-01h 1 24 -4.1969325e+02 7.57e-05 4.04e-01 -5.0 1.29e-01 -2.3 3.43e-01 2.99e-01h 1 25 -4.1969915e+02 9.18e-05 8.03e-01 -5.0 8.05e+00 - 1.68e-01 7.83e-02h 1 26 -4.1970105e+02 8.77e-05 7.75e-01 -5.0 3.75e+00 - 8.01e-02 4.12e-02h 1 27 -4.1970238e+02 8.42e-05 7.49e-01 -5.0 2.54e+00 - 1.47e-01 3.75e-02h 3 28 -4.1970411e+02 7.90e-05 7.91e-01 -5.0 2.46e+00 - 1.08e-01 5.77e-02h 3 29 -4.1970524e+02 7.53e-05 1.62e+00 -5.0 2.34e+00 - 2.07e-01 4.34e-02h 3 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.1970423e+02 4.35e-05 9.48e-01 -5.0 1.39e-01 -2.8 9.50e-01 4.01e-01h 1 31 -4.1970650e+02 3.82e-05 8.58e-01 -5.0 2.27e+00 - 1.12e-01 1.08e-01h 1 32 -4.1970658e+02 3.80e-05 1.06e+00 -5.0 6.75e+00 -2.3 7.20e-03 4.03e-03h 2 33 -4.1970602e+02 4.12e-05 1.80e+00 -5.0 1.59e-01 -1.9 1.00e+00 2.06e-01h 1 34 -4.1970711e+02 9.66e-05 1.68e+00 -5.0 2.05e+00 - 3.46e-02 5.62e-02h 1 35 -4.1970941e+02 1.19e-04 1.48e+00 -5.0 1.89e+00 - 1.27e-01 1.33e-01h 1 36 -4.1970937e+02 7.89e-05 7.90e-01 -5.0 6.10e-02 -1.5 5.30e-01 3.63e-01h 1 37 -4.1970997e+02 7.86e-05 6.61e-01 -5.0 2.45e-01 -2.0 1.88e-01 1.41e-01f 1 38 -4.1971197e+02 7.95e-05 7.10e-01 -5.0 1.65e+00 - 4.63e-02 1.22e-01h 1 39 -4.1971246e+02 7.27e-05 1.82e+00 -5.0 1.58e-01 -2.4 5.64e-01 1.28e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 40 -4.1971294e+02 5.02e-06 8.27e-01 -5.0 3.25e-02 -2.0 4.65e-01 1.00e+00h 1 41 -4.1971415e+02 2.15e-05 4.85e-01 -5.0 1.22e-01 -2.5 3.59e-01 5.83e-01h 1 42 -4.1971505e+02 1.22e-05 1.35e-01 -5.0 5.77e-02 -2.1 1.00e+00 7.86e-01f 1 43 -4.1971573e+02 2.19e-05 4.94e-01 -5.0 1.69e-01 -2.5 6.00e-01 3.40e-01f 1 44 -4.1971733e+02 3.36e-05 7.19e-01 -5.0 1.40e+00 - 3.29e-01 2.12e-01f 1 45 -4.1971942e+02 5.99e-05 2.84e-01 -5.0 1.09e+00 - 6.10e-01 6.33e-01f 1 46 -4.1971985e+02 1.45e-05 8.81e-05 -5.0 4.04e-01 - 1.00e+00 1.00e+00h 1 47 -4.1971987e+02 0.00e+00 4.16e-06 -5.0 1.16e-02 - 1.00e+00 1.00e+00h 1 48 -4.1972499e+02 5.88e-06 1.11e-01 -7.5 3.10e-01 - 6.97e-01 4.86e-01h 1 49 -4.1972672e+02 6.70e-06 1.71e-01 -7.5 2.06e-01 - 8.04e-01 3.48e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 50 -4.1972786e+02 6.62e-06 1.65e-01 -7.5 1.52e-01 - 9.59e-01 3.73e-01h 1 51 -4.1972885e+02 5.72e-06 8.87e-02 -7.5 1.04e-01 - 1.00e+00 5.61e-01h 1 52 -4.1972935e+02 3.06e-06 3.36e-02 -7.5 4.96e-02 - 1.00e+00 7.09e-01h 1 53 -4.1972955e+02 4.25e-07 1.26e-03 -7.5 1.54e-02 - 1.00e+00 9.75e-01h 1 54 -4.1972956e+02 0.00e+00 2.02e-07 -7.5 4.72e-04 - 1.00e+00 1.00e+00f 1 55 -4.1972958e+02 2.12e-09 3.23e-04 -9.0 1.65e-03 - 1.00e+00 9.65e-01h 1 56 -4.1972958e+02 0.00e+00 1.78e-08 -9.0 1.90e-04 - 1.00e+00 1.00e+00f 1 57 -4.1972958e+02 0.00e+00 9.09e-10 -9.0 6.38e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 57 (scaled) (unscaled) Objective...............: -4.1972957972270086e+02 -4.1972957972270086e+02 Dual infeasibility......: 9.0915622575281028e-10 9.0915622575281028e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.2194629740377176e-09 1.2194629740377176e-09 Overall NLP error.......: 1.2194629740377176e-09 1.2194629740377176e-09 Number of objective function evaluations = 76 Number of objective gradient evaluations = 58 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 76 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 58 Number of Lagrangian Hessian evaluations = 57 Total CPU secs in IPOPT (w/o function evaluations) = 21.666 Total CPU secs in NLP function evaluations = 8.296 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 4 rhok = 10000 etak = 0.001 kmax = 20 K = 4 kmax = 20 rmax = 0.000441172 rmin = -5.67564e-05 K = 4 etak = 0.001 etak = 0.0001 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 5 kmax = 20 rhok = 10000 etak = 0.0001 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1965222e+02 0.00e+00 4.41e+00 -5.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1974029e+02 2.78e-04 1.22e-01 -5.0 1.72e-02 -2.0 9.99e-01 9.72e-01h 1 2 -4.1970656e+02 1.31e-04 2.85e-01 -5.0 4.17e-02 -2.5 7.60e-01 5.64e-01h 1 3 -4.1970654e+02 1.31e-04 1.21e+00 -5.0 2.45e+00 -3.0 1.55e-02 4.30e-04h 4 4 -4.1970468e+02 1.22e-04 1.13e+00 -5.0 6.74e-02 -1.6 1.22e-01 6.59e-02h 1 5 -4.1970127e+02 1.12e-04 1.15e+00 -5.0 8.40e-02 -2.1 4.59e-01 1.12e-01h 1 6 -4.1970120e+02 1.12e-04 1.15e+00 -5.0 8.48e+00 - 4.85e-03 4.85e-03h 4 7 -4.1970044e+02 1.13e-04 9.00e-01 -5.0 2.15e-01 -1.7 6.82e-02 3.02e-02h 1 8 -4.1970024e+02 1.12e-04 7.05e-01 -5.0 7.65e+00 - 1.55e-01 1.02e-02h 4 9 -4.1969854e+02 1.04e-04 8.24e-01 -5.0 2.15e+00 - 5.74e-01 7.33e-02h 3 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1968508e+02 7.35e-05 3.98e-01 -5.0 1.03e+00 - 9.45e-01 5.54e-01H 1 11 -4.1967584e+02 1.31e-05 1.24e-01 -5.0 2.24e-02 -2.2 1.00e+00 7.79e-01h 1 12 -4.1967296e+02 6.59e-07 2.19e-04 -5.0 1.83e-02 -2.6 1.00e+00 1.00e+00h 1 13 -4.1967308e+02 7.61e-06 3.46e-01 -5.0 2.19e-01 - 1.00e+00 2.63e-01h 2 14 -4.1967311e+02 1.17e-06 1.58e-04 -5.0 1.19e-01 - 1.00e+00 1.00e+00h 1 15 -4.1967312e+02 0.00e+00 3.13e-06 -5.0 8.70e-03 - 1.00e+00 1.00e+00h 1 16 -4.1967467e+02 2.69e-05 2.79e-01 -7.5 2.16e-01 - 3.38e-01 1.19e-01h 1 17 -4.1967908e+02 3.45e-05 1.79e-01 -7.5 1.90e-01 - 3.74e-01 4.54e-01h 1 18 -4.1968182e+02 2.75e-05 1.03e-01 -7.5 1.04e-01 - 7.47e-01 5.33e-01h 1 19 -4.1968236e+02 2.23e-05 2.52e-01 -7.5 4.79e-02 - 8.57e-01 2.06e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1968334e+02 1.42e-05 1.39e-01 -7.5 4.14e-02 - 1.00e+00 4.92e-01h 1 21 -4.1968388e+02 7.91e-06 6.78e-02 -7.5 2.50e-02 - 1.00e+00 5.36e-01h 1 22 -4.1968421e+02 3.00e-06 2.82e-02 -7.5 1.35e-02 - 1.00e+00 7.44e-01h 1 23 -4.1968428e+02 1.04e-06 1.57e-02 -7.5 4.62e-03 - 1.00e+00 6.69e-01h 1 24 -4.1968432e+02 7.36e-09 2.37e-06 -7.5 2.02e-03 - 1.00e+00 1.00e+00f 1 25 -4.1968432e+02 0.00e+00 3.29e-09 -7.5 1.51e-04 - 1.00e+00 1.00e+00h 1 26 -4.1968434e+02 1.49e-09 7.36e-03 -9.0 1.86e-03 - 1.00e+00 6.06e-01h 1 27 -4.1968435e+02 4.48e-09 5.73e-04 -9.0 1.23e-03 - 1.00e+00 9.53e-01f 1 28 -4.1968435e+02 0.00e+00 1.89e-08 -9.0 3.59e-04 - 1.00e+00 1.00e+00f 1 29 -4.1968435e+02 0.00e+00 1.06e-09 -9.0 9.72e-05 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 29 (scaled) (unscaled) Objective...............: -4.1968434690458139e+02 -4.1968434690458139e+02 Dual infeasibility......: 1.0644530081390549e-09 1.0644530081390549e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.5570259260090863e-10 9.5570259260090863e-10 Overall NLP error.......: 1.0644530081390549e-09 1.0644530081390549e-09 Number of objective function evaluations = 52 Number of objective gradient evaluations = 30 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 52 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 30 Number of Lagrangian Hessian evaluations = 29 Total CPU secs in IPOPT (w/o function evaluations) = 9.582 Total CPU secs in NLP function evaluations = 4.687 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 5 rhok = 10000 etak = 0.0001 kmax = 20 K = 5 kmax = 20 rmax = 0.000218302 rmin = -8.70625e-05 K = 5 rhok = 10000 rhok = 1e+05 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 6 kmax = 20 rhok = 1e+05 etak = 0.0001 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 mu_init=1e-6 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1971804e+02 4.29e-04 1.96e+01 -6.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1976891e+02 3.34e-04 6.49e-01 -6.0 1.03e-02 0.0 1.00e+00 9.67e-01h 1 2 -4.1975670e+02 2.31e-04 1.82e+00 -6.0 9.11e-03 -0.5 6.20e-01 3.11e-01h 1 3 -4.1972531e+02 1.39e-04 1.01e+00 -6.0 2.97e-02 -1.0 3.35e-01 4.00e-01h 1 4 -4.1970154e+02 9.75e-05 8.18e-01 -6.0 3.86e-02 -1.4 3.15e-01 4.03e-01h 1 5 -4.1969294e+02 8.77e-05 3.69e-01 -6.0 4.63e-02 -1.9 4.32e-01 2.52e-01h 1 6 -4.1968653e+02 6.77e-05 2.06e+00 -6.0 2.27e-02 -1.5 6.58e-01 2.44e-01h 1 7 -4.1968365e+02 5.77e-05 1.94e+00 -6.0 4.63e-02 -2.0 5.70e-01 1.63e-01h 1 8 -4.1967800e+02 3.78e-05 1.02e+00 -6.0 1.15e-01 -2.4 5.54e-01 4.61e-01h 1 9 -4.1967670e+02 2.76e-05 7.44e-01 -6.0 1.43e-01 -2.9 2.20e-01 2.77e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1967432e+02 1.69e-05 5.97e-01 -6.0 1.62e-02 -1.6 1.00e+00 3.94e-01h 1 11 -4.1967056e+02 3.70e-06 2.94e-02 -6.0 4.99e-03 -1.2 1.00e+00 9.64e-01h 1 12 -4.1967071e+02 1.68e-05 1.83e-01 -6.0 5.69e-02 -1.6 2.37e-01 1.55e-01f 1 13 -4.1967086e+02 1.22e-05 4.13e-01 -6.0 1.01e-02 -1.2 1.00e+00 6.34e-01f 1 14 -4.1967091e+02 1.22e-05 2.90e+00 -6.0 5.68e-02 -1.7 5.33e-01 2.31e-02f 1 15 -4.1967133e+02 1.52e-05 1.46e+00 -6.0 2.13e-02 -2.2 5.09e-01 3.40e-01h 1 16 -4.1967191e+02 1.47e-05 1.11e+00 -6.0 5.65e-02 -2.6 2.59e-01 3.54e-01h 1 17 -4.1967253e+02 1.18e-05 6.24e-01 -6.0 1.49e-01 -3.1 4.22e-01 3.03e-01f 1 18 -4.1967262e+02 1.15e-05 2.75e+00 -6.0 3.36e-01 -3.6 9.44e-01 3.55e-02h 1 19 -4.1967313e+02 1.42e-05 1.78e+00 -6.0 1.40e+00 -4.1 5.55e-01 1.41e-01h 2 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1967381e+02 1.92e-05 9.36e-01 -6.0 4.15e-01 -3.6 7.40e-01 4.26e-01h 1 21 -4.1967392e+02 2.01e-05 9.89e-01 -6.0 1.75e+00 -4.1 9.27e-01 3.94e-02h 3 22 -4.1967395e+02 2.04e-05 1.01e+00 -6.0 4.47e+01 - 5.18e-02 6.69e-04h 4 23 -4.1967432e+02 2.18e-05 6.09e-01 -6.0 4.45e-01 - 1.00e+00 3.63e-01h 1 24 -4.1967461e+02 1.30e-05 8.75e-02 -6.0 2.07e-01 - 1.00e+00 8.64e-01h 1 25 -4.1967466e+02 0.00e+00 2.69e-05 -6.0 2.35e-02 - 1.00e+00 1.00e+00h 1 26 -4.1967467e+02 0.00e+00 1.88e-06 -6.0 5.11e-03 - 1.00e+00 1.00e+00h 1 27 -4.1967519e+02 1.11e-06 1.18e-01 -9.0 2.05e-02 - 8.56e-01 5.58e-01h 1 28 -4.1967540e+02 9.29e-07 1.47e-01 -9.0 1.24e-02 - 9.13e-01 5.12e-01h 1 29 -4.1967546e+02 6.97e-07 1.77e-01 -9.0 7.03e-03 - 1.00e+00 2.87e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.1967551e+02 4.91e-07 1.80e-01 -9.0 5.21e-03 - 1.00e+00 3.30e-01h 1 31 -4.1967557e+02 2.26e-07 9.30e-02 -9.0 3.52e-03 - 1.00e+00 6.17e-01h 1 32 -4.1967559e+02 1.25e-07 6.22e-02 -9.0 1.36e-03 - 1.00e+00 4.62e-01h 1 33 -4.1967560e+02 5.30e-08 3.53e-02 -9.0 7.32e-04 - 1.00e+00 5.82e-01h 1 34 -4.1967560e+02 1.37e-08 1.21e-02 -9.0 3.06e-04 - 1.00e+00 7.37e-01f 1 35 -4.1967560e+02 0.00e+00 5.22e-04 -9.0 8.08e-05 - 1.00e+00 9.64e-01f 1 36 -4.1967560e+02 0.00e+00 4.55e-10 -9.0 5.22e-06 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 36 (scaled) (unscaled) Objective...............: -4.1967560247428997e+02 -4.1967560247428997e+02 Dual infeasibility......: 4.5474658175150911e-10 4.5474658175150911e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.3973715463877508e-09 1.3973715463877508e-09 Overall NLP error.......: 1.3973715463877508e-09 1.3973715463877508e-09 Number of objective function evaluations = 48 Number of objective gradient evaluations = 37 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 48 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 37 Number of Lagrangian Hessian evaluations = 36 Total CPU secs in IPOPT (w/o function evaluations) = 13.370 Total CPU secs in NLP function evaluations = 5.222 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 6 rhok = 1e+05 etak = 0.0001 kmax = 20 K = 6 kmax = 20 rmax = 9.8234e-05 rmin = -3.10405e-05 K = 6 etak = 0.0001 etak = 1e-05 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 7 kmax = 20 rhok = 1e+05 etak = 1e-05 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 mu_init=1e-6 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1966974e+02 0.00e+00 9.82e+00 -6.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1968017e+02 2.46e-04 2.42e-01 -6.0 1.03e-02 0.0 1.00e+00 9.75e-01h 1 2 -4.1967786e+02 3.09e-05 1.92e-01 -6.0 1.27e-03 -0.5 1.00e+00 8.75e-01h 1 3 -4.1967400e+02 1.60e-05 4.82e-01 -6.0 2.90e-02 - 3.28e-01 6.02e-01h 1 4 -4.1967199e+02 6.01e-06 3.13e-01 -6.0 1.92e-02 - 6.18e-01 7.21e-01h 1 5 -4.1967199e+02 6.10e-06 8.07e-01 -6.0 3.71e-01 - 7.25e-02 6.89e-03h 4 6 -4.1967110e+02 1.70e-07 2.51e-02 -6.0 7.82e-04 -1.0 1.00e+00 9.55e-01h 1 7 -4.1967109e+02 1.08e-07 2.35e-01 -6.0 1.23e-03 -1.4 1.00e+00 2.50e-01h 3 8 -4.1967104e+02 0.00e+00 2.52e-05 -6.0 2.04e-03 -1.9 1.00e+00 1.00e+00h 1 9 -4.1967104e+02 0.00e+00 1.18e-04 -6.0 6.18e-03 -2.4 1.00e+00 1.00e+00H 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1967104e+02 1.82e-08 3.55e-05 -6.0 3.10e-03 -2.0 1.00e+00 1.00e+00h 1 11 -4.1967105e+02 7.47e-07 9.90e-04 -6.0 1.73e-02 -2.4 1.00e+00 1.00e+00H 1 12 -4.1967105e+02 7.45e-07 2.28e+00 -6.0 6.22e-02 -2.9 7.10e-01 7.95e-03h 7 13 -4.1967105e+02 7.45e-07 3.35e+00 -6.0 7.87e-02 -2.5 1.00e+00 7.80e-03h 6 14 -4.1967105e+02 7.47e-07 2.24e+00 -6.0 5.85e-02 -3.0 7.73e-01 1.56e-02h 7 15 -4.1967105e+02 7.21e-07 9.44e-01 -6.0 1.49e-02 -2.5 1.00e+00 1.86e-01h 1 16 -4.1967105e+02 7.21e-07 1.98e+00 -6.0 8.02e-02 - 3.05e-01 8.14e-03f 7 17 -4.1967105e+02 7.25e-07 5.38e+00 -6.0 1.25e+00 -2.1 4.29e-02 3.05e-04h 5 18 -4.1967105e+02 7.25e-07 2.92e+00 -6.0 8.53e-02 - 6.78e-01 6.99e-03h 8 19 -4.1967106e+02 6.52e-07 7.65e-01 -6.0 1.10e-02 -2.6 1.00e+00 2.12e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 20 -4.1967106e+02 7.01e-07 1.66e+00 -6.0 3.44e-02 - 8.41e-01 6.25e-02f 5 21 -4.1967106e+02 7.08e-07 8.94e+00 -6.0 1.73e-01 -2.2 5.45e-01 4.96e-03h 4 22 -4.1967106e+02 7.04e-07 2.70e-01 -6.0 2.29e-03 -1.7 1.00e+00 4.16e-03h 2 23 -4.1967110e+02 1.56e-05 1.40e-03 -6.0 2.54e-02 - 1.00e+00 1.00e+00H 1 24 -4.1967107e+02 0.00e+00 3.70e-05 -6.0 2.32e-03 - 1.00e+00 1.00e+00h 1 25 -4.1967107e+02 0.00e+00 2.33e-07 -6.0 5.59e-04 - 1.00e+00 1.00e+00h 1 26 -4.1967161e+02 1.23e-06 4.25e-02 -9.0 2.16e-02 - 6.84e-01 5.70e-01h 1 27 -4.1967181e+02 9.53e-07 1.59e-01 -9.0 1.29e-02 - 9.28e-01 4.68e-01h 1 28 -4.1967189e+02 6.86e-07 1.64e-01 -9.0 8.67e-03 - 9.49e-01 3.35e-01h 1 29 -4.1967198e+02 3.81e-07 9.26e-02 -9.0 6.19e-03 - 1.00e+00 5.31e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 30 -4.1967201e+02 2.37e-07 9.99e-02 -9.0 2.99e-03 - 1.00e+00 3.98e-01h 1 31 -4.1967203e+02 1.05e-07 6.38e-02 -9.0 1.84e-03 - 1.00e+00 6.06e-01h 1 32 -4.1967204e+02 6.09e-08 5.62e-02 -9.0 7.28e-04 - 1.00e+00 4.49e-01h 1 33 -4.1967205e+02 1.41e-08 1.18e-02 -9.0 4.04e-04 - 1.00e+00 8.41e-01f 1 34 -4.1967205e+02 0.00e+00 2.51e-07 -9.0 6.69e-05 - 1.00e+00 1.00e+00f 1 35 -4.1967205e+02 0.00e+00 2.69e-09 -9.0 6.19e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 35 (scaled) (unscaled) Objective...............: -4.1967205029093469e+02 -4.1967205029093469e+02 Dual infeasibility......: 2.6891012245349881e-09 2.6891012245349881e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.1137811309445136e-09 1.1137811309445136e-09 Overall NLP error.......: 2.6891012245349881e-09 2.6891012245349881e-09 Number of objective function evaluations = 102 Number of objective gradient evaluations = 36 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 102 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 36 Number of Lagrangian Hessian evaluations = 35 Total CPU secs in IPOPT (w/o function evaluations) = 13.066 Total CPU secs in NLP function evaluations = 6.994 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 7 rhok = 1e+05 etak = 1e-05 kmax = 20 K = 7 kmax = 20 rmax = 3.92404e-05 rmin = -2.67224e-05 K = 7 rhok = 1e+05 rhok = 1e+06 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 8 kmax = 20 rhok = 1e+06 etak = 1e-05 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 mu_init=1e-6 mu_init=1e-7 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1967484e+02 9.20e-05 3.53e+01 -7.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1968023e+02 2.52e-04 8.89e-01 -7.0 1.03e-02 0.0 9.75e-01 9.75e-01h 1 2 -4.1967848e+02 4.94e-05 3.09e-01 -7.0 4.18e-03 -0.5 9.95e-01 8.03e-01h 1 3 -4.1967533e+02 4.36e-05 8.77e-01 -7.0 8.06e-02 - 2.49e-01 4.21e-01h 1 4 -4.1967275e+02 1.09e-05 7.69e-01 -7.0 5.75e-02 - 4.94e-01 6.28e-01h 1 5 -4.1967178e+02 4.02e-06 4.94e-01 -7.0 1.19e-02 - 1.00e+00 7.27e-01h 1 6 -4.1967162e+02 2.29e-06 2.13e-01 -7.0 1.03e-02 - 3.71e-01 4.68e-01h 1 7 -4.1967147e+02 6.80e-07 1.76e-01 -7.0 8.87e-03 - 1.00e+00 7.74e-01h 1 8 -4.1967141e+02 1.22e-07 2.14e-05 -7.0 5.79e-03 - 1.00e+00 1.00e+00h 1 9 -4.1967141e+02 0.00e+00 1.60e-06 -7.0 1.21e-03 - 1.00e+00 1.00e+00h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1967141e+02 0.00e+00 1.20e-07 -7.0 3.24e-04 - 1.00e+00 1.00e+00h 1 11 -4.1967146e+02 5.37e-09 1.99e-01 -9.0 4.48e-03 - 9.43e-01 5.27e-01h 1 12 -4.1967148e+02 1.26e-08 2.41e-01 -9.0 2.33e-03 - 1.00e+00 4.59e-01h 1 13 -4.1967149e+02 1.05e-08 1.85e-01 -9.0 1.41e-03 - 1.00e+00 4.35e-01f 1 14 -4.1967150e+02 6.47e-09 9.15e-02 -9.0 8.52e-04 - 1.00e+00 5.47e-01f 1 15 -4.1967150e+02 2.83e-09 5.84e-02 -9.0 4.10e-04 - 1.00e+00 5.95e-01f 1 16 -4.1967150e+02 1.86e-10 2.10e-02 -9.0 1.76e-04 - 1.00e+00 8.11e-01f 1 17 -4.1967150e+02 1.70e-11 4.35e-04 -9.0 3.44e-05 - 1.00e+00 9.88e-01f 1 18 -4.1967150e+02 0.00e+00 4.28e-10 -9.0 6.70e-07 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: -4.1967150204900338e+02 -4.1967150204900338e+02 Dual infeasibility......: 4.2811809373242606e-10 4.2811809373242606e-10 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 9.3387687571270639e-10 9.3387687571270639e-10 Overall NLP error.......: 9.3387687571270639e-10 9.3387687571270639e-10 Number of objective function evaluations = 19 Number of objective gradient evaluations = 19 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 19 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 19 Number of Lagrangian Hessian evaluations = 18 Total CPU secs in IPOPT (w/o function evaluations) = 5.370 Total CPU secs in NLP function evaluations = 2.419 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 8 rhok = 1e+06 etak = 1e-05 kmax = 20 K = 8 kmax = 20 rmax = 4.2167e-06 rmin = -3.59735e-06 K = 8 etak = 1e-05 etak = 1e-06 na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 9 kmax = 20 rhok = 1e+06 etak = 1e-06 32580 variables, all nonlinear 32221 constraints; 161460 nonzeros 32220 nonlinear constraints 1 linear constraint 32221 inequality constraints 1 nonlinear objective; 32580 nonzeros. Ipopt 3.12.4: dual_inf_tol=1e-6 max_iter=5000 warm_start_init_point=yes mu_init=1e-4 mu_init=1e-5 mu_init=1e-6 mu_init=1e-7 ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Eclipse Public License (EPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.12.4, running with linear solver mumps. NOTE: Other linear solvers might be more efficient (see Ipopt documentation). Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 161460 Number of nonzeros in Lagrangian Hessian.............: 32580 Total number of variables............................: 32580 variables with only lower bounds: 360 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 32221 inequality constraints with only lower bounds: 32221 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 -4.1967129e+02 0.00e+00 4.22e+00 -7.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 -4.1967138e+02 2.64e-04 1.11e-01 -7.0 1.03e-02 0.0 9.81e-01 9.74e-01h 1 2 -4.1967145e+02 5.25e-06 2.56e-03 -7.0 6.81e-04 -0.5 1.00e+00 9.80e-01h 1 3 -4.1967138e+02 1.39e-06 4.28e-02 -7.0 8.02e-03 - 7.01e-01 7.62e-01h 1 4 -4.1967132e+02 3.19e-07 6.24e-02 -7.0 3.31e-03 - 8.99e-01 7.48e-01h 1 5 -4.1967132e+02 3.13e-07 3.68e-01 -7.0 2.21e-03 - 1.00e+00 1.56e-02h 7 6 -4.1967128e+02 0.00e+00 1.42e-05 -7.0 2.42e-03 - 1.00e+00 1.00e+00h 1 7 -4.1967128e+02 0.00e+00 7.38e-08 -7.0 4.14e-05 - 1.00e+00 1.00e+00h 1 8 -4.1967133e+02 6.41e-09 1.96e-01 -9.0 5.13e-03 - 9.43e-01 5.31e-01h 1 9 -4.1967135e+02 1.34e-08 2.38e-01 -9.0 3.55e-03 - 1.00e+00 4.62e-01h 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 -4.1967137e+02 1.11e-08 1.73e-01 -9.0 2.35e-03 - 1.00e+00 4.77e-01h 1 11 -4.1967137e+02 6.50e-09 8.90e-02 -9.0 1.35e-03 - 1.00e+00 5.46e-01f 1 12 -4.1967138e+02 2.11e-09 3.52e-02 -9.0 6.36e-04 - 1.00e+00 7.27e-01f 1 13 -4.1967138e+02 4.43e-10 1.27e-02 -9.0 1.91e-04 - 1.00e+00 7.78e-01f 1 14 -4.1967138e+02 0.00e+00 3.35e-08 -9.0 4.63e-05 - 1.00e+00 1.00e+00f 1 15 -4.1967138e+02 0.00e+00 5.24e-09 -9.0 2.11e-06 - 1.00e+00 1.00e+00h 1 Number of Iterations....: 15 (scaled) (unscaled) Objective...............: -4.1967138055927921e+02 -4.1967138055927921e+02 Dual infeasibility......: 5.2371337529840934e-09 5.2371337529840934e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 1.5882438179666244e-09 1.5882438179666244e-09 Overall NLP error.......: 5.2371337529840934e-09 5.2371337529840934e-09 Number of objective function evaluations = 22 Number of objective gradient evaluations = 16 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 22 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 16 Number of Lagrangian Hessian evaluations = 15 Total CPU secs in IPOPT (w/o function evaluations) = 4.589 Total CPU secs in NLP function evaluations = 2.278 EXIT: Optimal Solution Found. Ipopt 3.12.4: Optimal Solution Found na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 K = 9 rhok = 1e+06 etak = 1e-06 kmax = 20 K = 9 kmax = 20 rmax = 9.39862e-07 rmin = -7.41385e-07 Stopping: rnorm is small K = 9 rnorm = 9.39862e-07 : c y := 1 1 1 1 1 2.62685 2.38168 1 1 1 1 2 3.16739 3.01425 1 1 1 2 1 2.02303 1.72286 1 1 1 2 2 2.21531 1.9274 1 1 2 1 1 3.1674 3.01426 1 1 2 1 2 3.5194 3.42975 1 1 2 2 1 2.4752 2.21926 1 1 2 2 2 2.6268 2.38163 1 1 3 1 1 3.35194 3.23691 1 1 3 1 2 3.635 3.56318 1 1 3 2 1 2.62685 2.38168 1 1 3 2 2 2.62685 2.38168 1 2 1 1 1 2.6268 2.38163 1 2 1 1 2 2.62685 2.38168 1 2 1 2 1 2.09261 1.79637 1 2 1 2 2 2.21531 1.9274 1 2 2 1 1 2.84919 2.64518 1 2 2 1 2 2.89408 2.69808 1 2 2 2 1 2.40046 2.13964 1 2 2 2 2 2.4752 2.21926 1 2 3 1 1 3.01472 2.84103 1 2 3 1 2 3.1674 3.01425 1 2 3 2 1 2.62681 2.38163 1 2 3 2 2 2.62681 2.38164 1 3 1 1 1 2.4752 2.21926 1 3 1 1 2 2.6268 2.38163 1 3 1 2 1 2.17722 1.88739 1 3 1 2 2 2.21531 1.9274 1 3 2 1 1 2.62683 2.38165 1 3 2 1 2 2.62685 2.38168 1 3 2 2 1 2.34175 2.07621 1 3 2 2 2 2.40046 2.13963 1 3 3 1 1 2.70991 2.48548 1 3 3 1 2 2.78823 2.57631 1 3 3 2 1 2.49295 2.23841 1 3 3 2 2 2.49295 2.23841 2 1 1 1 1 3.5194 3.42975 2 1 1 1 2 4.67279 4.74655 2 1 1 2 1 2.62681 2.38163 2 1 1 2 2 2.84919 2.64518 2 1 2 1 1 4.03471 4.01681 2 1 2 1 2 5.03412 5.1358 2 1 2 2 1 2.89407 2.69808 2 1 2 2 2 3.1674 3.01426 2 1 3 1 1 4.35157 4.38928 2 1 3 1 2 5.42562 5.56159 2 1 3 2 1 3.1674 3.01426 2 1 3 2 2 3.5194 3.42975 2 2 1 1 1 3.1674 3.01426 2 2 1 1 2 3.63483 3.56298 2 2 1 2 1 2.62681 2.38164 2 2 1 2 2 2.84919 2.64518 2 2 2 1 1 3.5194 3.42975 2 2 2 1 2 4.0347 4.0168 2 2 2 2 1 2.84919 2.64518 2 2 2 2 2 3.03153 2.86046 2 2 3 1 1 3.71486 3.65692 2 2 3 1 2 4.03471 4.01681 2 2 3 2 1 3.12193 2.96349 2 2 3 2 2 3.1674 3.01426 2 3 1 1 1 3.0147 2.84101 2 3 1 1 2 3.1674 3.01426 2 3 1 2 1 2.62685 2.38168 2 3 1 2 2 2.78823 2.57631 2 3 2 1 1 3.1674 3.01426 2 3 2 1 2 3.35194 3.23691 2 3 2 2 1 2.84919 2.64518 2 3 2 2 2 2.89407 2.69808 2 3 3 1 1 3.34555 3.22974 2 3 3 1 2 3.40944 3.30494 2 3 3 2 1 2.89408 2.69808 2 3 3 2 2 3.01471 2.84102 3 1 1 1 1 4.84526 4.9333 3 1 1 1 2 6.60016 6.86044 3 1 1 2 1 3.1674 3.01426 3 1 1 2 2 4.0347 4.0168 3 1 2 1 1 5.42562 5.56159 3 1 2 1 2 6.83834 7.11511 3 1 2 2 1 3.63463 3.56274 3 1 2 2 2 4.03471 4.01681 3 1 3 1 1 5.46485 5.60493 3 1 3 1 2 7.35483 7.66981 3 1 3 2 1 4.03471 4.0168 3 1 3 2 2 4.67279 4.74655 3 2 1 1 1 4.03471 4.01681 3 2 1 1 2 4.84526 4.9333 3 2 1 2 1 3.1674 3.01426 3 2 1 2 2 3.5194 3.42975 3 2 2 1 1 4.35164 4.38936 3 2 2 1 2 5.03415 5.13583 3 2 2 2 1 3.5194 3.42975 3 2 2 2 2 3.80716 3.76333 3 2 3 1 1 4.67277 4.74654 3 2 3 1 2 5.38112 5.51476 3 2 3 2 1 3.63489 3.56304 3 2 3 2 2 4.03471 4.0168 3 3 1 1 1 3.63436 3.56244 3 3 1 1 2 4.0347 4.0168 3 3 1 2 1 3.1674 3.01426 3 3 1 2 2 3.35194 3.23691 3 3 2 1 1 3.80716 3.76333 3 3 2 1 2 4.03471 4.01681 3 3 2 2 1 3.35192 3.23688 3 3 2 2 2 3.5194 3.42975 3 3 3 1 1 4.0347 4.0168 3 3 3 1 2 4.03471 4.01681 3 3 3 2 1 3.50809 3.41726 3 3 3 2 2 3.63424 3.5623 4 1 1 1 1 5.84985 6.02509 4 1 1 1 2 8.73198 9.1521 4 1 1 2 1 4.03471 4.0168 4 1 1 2 2 5.42562 5.56159 4 1 2 1 1 6.60013 6.86041 4 1 2 1 2 9.06834 9.5141 4 1 2 2 1 4.43232 4.48008 4 1 2 2 2 5.77811 5.94656 4 1 3 1 1 6.83834 7.11511 4 1 3 1 2 9.06834 9.5141 4 1 3 2 1 4.84526 4.9333 4 1 3 2 2 5.84985 6.02509 4 2 1 1 1 5.03267 5.13421 4 2 1 1 2 5.84985 6.02509 4 2 1 2 1 3.71486 3.65693 4 2 1 2 2 4.43234 4.4801 4 2 2 1 1 5.42562 5.56159 4 2 2 1 2 6.21463 6.44252 4 2 2 2 1 4.03471 4.01681 4 2 2 2 2 4.84526 4.9333 4 2 3 1 1 5.46485 5.60493 4 2 3 1 2 6.59818 6.85834 4 2 3 2 1 4.34535 4.38231 4 2 3 2 2 5.00527 5.10495 4 3 1 1 1 4.29314 4.32399 4 3 1 1 2 4.84526 4.9333 4 3 1 2 1 3.63521 3.56343 4 3 1 2 2 4.03471 4.01681 4 3 2 1 1 4.48558 4.53973 4 3 2 1 2 5.00526 5.10494 4 3 2 2 1 3.97469 3.95254 4 3 2 2 2 4.03471 4.01681 4 3 3 1 1 4.67277 4.74654 4 3 3 1 2 5.03267 5.13421 4 3 3 2 1 4.03471 4.01681 4 3 3 2 2 4.24122 4.26585 5 1 1 1 1 7.54509 7.86986 5 1 1 1 2 11.4559 12.1869 5 1 1 2 1 5.00527 5.10494 5 1 1 2 2 6.83834 7.11511 5 1 2 1 1 7.89816 8.24775 5 1 2 1 2 12.0491 12.7952 5 1 2 2 1 5.42563 5.56159 5 1 2 2 2 7.35483 7.66981 5 1 3 1 1 8.10593 8.47319 5 1 3 1 2 12.3276 13.0765 5 1 3 2 1 5.77811 5.94656 5 1 3 2 2 7.54509 7.86986 5 2 1 1 1 5.84985 6.02509 5 2 1 1 2 7.54509 7.86986 5 2 1 2 1 4.48558 4.53973 5 2 1 2 2 5.42563 5.5616 5 2 2 1 1 6.21462 6.44252 5 2 2 1 2 7.66143 7.99495 5 2 2 2 1 5.00526 5.10494 5 2 2 2 2 5.77811 5.94656 5 2 3 1 1 6.59817 6.85833 5 2 3 1 2 7.89816 8.24774 5 2 3 2 1 5.03415 5.13583 5 2 3 2 2 5.84985 6.02509 5 3 1 1 1 5.03271 5.13425 5 3 1 1 2 5.68799 5.85038 5 3 1 2 1 4.29314 4.32398 5 3 1 2 2 4.84526 4.9333 5 3 2 1 1 5.38112 5.51476 5 3 2 1 2 5.77811 5.94656 5 3 2 2 1 4.48558 4.53973 5 3 2 2 2 5.00526 5.10494 5 3 3 1 1 5.42562 5.56159 5 3 3 1 2 5.84985 6.02509 5 3 3 2 1 4.67277 4.74654 5 3 3 2 2 5.03267 5.13421 ; na = 5 nb = 3 nc = 3 nd = 2 ne = 2 primreg = 1e-08 rhok = 1e+06 etak = 1e-06 rnorm = 9.39862e-07 Created 5DNCLipopt.log