MINOS 5.5: optimal solution found.
5 iterations, objective 0
Nonlin evals: constrs = 44, Jac = 43.
Objective = find a feasible point.
x1 = -0.477429
x10 = -0.618197
x11 = -0.617504
x12 = -0.617737
x13 = -0.617904
x14 = -0.61801
x15 = -0.618058
x16 = -0.618063
x17 = -0.618047
x18 = -0.618011
x19 = -0.618872
x2 = -0.477446
x20 = -0.586277
x3 = -0.52041
x4 = -0.558777
x5 = -0.593114
x6 = -0.625071
x7 = -0.623199
x8 = -0.621375
x9 = -0.619576