MINOS 5.5: optimal solution found.
16 iterations, objective 0
Nonlin evals: constrs = 59, Jac = 58.
Objective = find a feasible point.
xi [*] :=
1  -0.521584
2   1.4411
3  -0.0139994
;

A :=
1 1    0.69704
1 2    0.703811
1 3   -0.137061
2 1   -0.700985
2 2    0.709089
2 3    0.0762462
;