I would like to know if the following conjecture is true or false?
If $f(x) = g(x) + h(x)$ where $g$ is m-strongly convex and $h$ is convex, then $f$ is m-strongly convex.
NOTE: For a non-differentiable function $F$, m-strongly convexity means $F(y) \geq F(x) + g^T(y - x) + \frac{m}{2} ||y - x||^2, \forall x, y$ where $g \in \partial F(x)$ is a subgradient of $F$ at $x$. If $F$ is differentiable, m-strongly convexity can also be defined as $\nabla^2 F(x) \succeq m I, \forall x$ where $I$ is the identity matrix. You can see the wikipedia page, this blog post by Sébastien Bubeck, or these lecture notes from the Algorithms course at Cornell University for more details on strong convexity.