Restrict to an arbitrary line segment by defining for . The chain rule and the assumed positive semidefinite matrix condition on the Hessian matrix give
Thus is non-decreasing. For , integrating on the two subintervals gives
Rearranging, and including the immediate endpoint cases, yields
This is precisely the definition of a convex function.
Use the intended strong convexity bound . The original PDF omits on the right. The printed bound for every is impossible when , as shows. Equivalently, the intended bound is stated for unit vectors. The norm of is the operator norm induced by the Euclidean norm, or any matrix norm that bounds it.
Set
This function is , and its Hessian matrix satisfies
Part (i) therefore proves that is a convex function. The perturbation can use up the entire positive lower bound defining a strongly convex function; only convexity, rather than strict positivity of the Hessian matrix, is asserted.

Articles by others on the same topic (0)

There are currently no matching articles.