MINOS 5.5: optimal solution found.
473 iterations, objective 0
Nonlin evals: constrs = 1120, Jac = 1119.
Objective = find a feasible point.
b [*] :=
1  -1.45686
2  -0.281768
3   0.571629
;

A [*,*] (tr)
:        1             2             3         :=
1    0.349837     -0.855628     -0.379899
2   -0.647247     -0.514899      0.560909
3    0.676192     -0.0496788     0.734683
4    0.00318424   -0.00605109   -0.0272871
5    0.0116974    -0.0150981    -0.00567029
6   -0.0326986     0.00607497    0.0117411
7    0.0153153     0.00331338   -0.0196051
;