MINOS 5.5: optimal solution found.
185 iterations, objective 0
Nonlin evals: constrs = 49, Jac = 48.
Objective = find a feasible point.
h [*] :=
0   0.0085694
1   0.0238871
2   0.003748
3  -0.0528113
4  -0.0222582
5   0.0508596
6  -0.0205716
7  -0.122638
8   0.0961794
9   0.485048
;

t = 1.11193