Solution

ID: past-exam-of-the-optimisation-for-data-science-course-of-the-university-of-oxford/2023/1/d/solution

Fix , and write and . The supplied subgradient relation gives with . The evaluation point in is , whereas is a subgradient at the new point .
Apply the subgradient inequality at , with comparison point :
The descent lemma for the -Lipschitz gradient of gives
Adding these estimates proves the stronger, explicit inequality
In particular, the objective function decreases for whenever the proximal gradient mapping is nonzero.
To justify the requested big O notation, we must check that , which depends on , stays bounded. Suppose is nonempty, and choose a fixed in this subdifferential. This holds for a finite-valued convex function on , including both norms in parts (a) and (b). By monotonicity of a convex subdifferential,
Substituting and , and then using the Cauchy-Schwarz inequality, yields
Thus , uniformly in . This local boundedness of the proximal gradient mapping makes the remainder at most , so
No differentiability of is needed. If an proper extended-real function is allowed as the regularization term, the subdifferential condition at is a qualification for this uniform remainder; the preceding explicit descent inequality remains the useful statement whenever its quantities are finite.

New to topics? Read the docs here!