There's a nice proof using a baby version of Hölder’s inequality.
The log-convexity condition on a positive function $f$ is equivalent to the inequality
$$f\left(\frac1{p}x + \frac1{q}y\right) \leq f(x)^{\frac1{p}} \cdot f(y)^\frac1{q}$$
for all $x, y \in \mathrm{dom}(f)$ and all positive numbers $p, q$ satisfying $\frac1{p} + \frac1{q} = 1$. The version of Hölder’s inequality we'll use states that for positive numbers $s, t, u, v$,
$$su + tv \leq (s^p + t^p)^\frac1{p} \cdot (u^q + v^q)^\frac1{q}$$
(which is a special case of the usual Hölder’s inequality by considering a two-point measure space with counting measure -- clearly overkill, but the connection with Hölder is irresistible to point out).
For log-convex functions $f, g$ and points $x, y$ in their common domain, put
$$s = f(x)^\frac1{p}, \qquad t = g(x)^\frac1{p}, \qquad u = f(y)^\frac1{q}, \qquad v = g(y)^\frac1{q}.$$
Then log-convexity of $f + g$ follows from
$$\begin{array}{ccc}
f\left(\frac1{p}x + \frac1{q}y\right) + g\left(\frac1{p}x + \frac1{q}y\right) & \leq & f(x)^\frac1{p} f(y)^\frac1{q} + g(x)^\frac1{p} g(y)^\frac1{q} \\
& \leq & (f(x) + g(x))^\frac1{p} \cdot (f(y) + g(y))^\frac1{q}
\end{array}$$
where the first line used log-convexity of $f$ and $g$, and the second is by Hölder. Done!