I have a convex optimization problem of the following form subject to some affine constraints: $$\min_p c_1(a^tp)^{-1}+c_2 (b^tp) + c_3 (d^tp)^2$$ $$\text{s.t. some affine constraints}$$
where $c_i$ is a constant scalar. I know that for the feasible set, the objective is convex, but I cannot transfer it into a known category, like GP, QOQC, ...
I tried to map it to a geometric programming, but I reached to a $\frac{\text{posynomial}}{\text{posynomial}}$, which I couldn't continue furthermore. Any idea?