MINOS 5.5: optimal solution found.
0 iterations, objective 0
Nonlin evals: constrs = 5, Jac = 4.
Objective = find a feasible point.
X1 = -0.0232104
X10 = -0.163543
X11 = -0.168815
X12 = -0.171266
X13 = -0.170605
X14 = -0.166499
X15 = -0.158564
X16 = -0.146361
X17 = -0.129378
X18 = -0.107016
X19 = -0.0785774
X2 = -0.045202
X20 = -0.0432334
X3 = -0.065881
X4 = -0.0851437
X5 = -0.102875
X6 = -0.118948
X7 = -0.13322
X8 = -0.145532
X9 = -0.155707