In[1]:= Timing[ NMinimize[{Abs[
...all of your expression unchanged until I change the last line to...
a>0 && b>0 && c>0 && d>0 && e>0 && f>0}, {a, b, c, d, e, f}, Method -> "RandomSearch"]]
Out[1]= {2.074813, {7.76376, {a -> 1., b -> 2., c -> 3., d -> 4., e -> 3.16253, f -> 5.4614}}}
So in two seconds on a modest machine NMinimize and RandomSearch provides you an approximate solution.
Is this sufficient?
If I try it without the RandomSearch option then it returns
Out[2]= {0.608404, {9.25992, {a -> 1., b -> 2., c -> 3., d -> 4., e -> 0.794416, f -> 1.40992}}}
More than three times faster, but with a substantially worse minimum. You can explore the other options if you look behind Details and Options on the help page.