From the Mosek cookbook, it is clear that by using the log-sum-exp transformation and some extra variable $u_k$, a geometric programing problem can be transform into a exponential cone presentation.
Therefore, my question is "Can geometric programming be considered as a special case of second order cone programming ?"
Thank you for your enthusiasm !