Solution

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

For the linear least-squares problem objective function, direct expansion with gives
Its gradient is , so the middle term equals .
Use the supplied thin singular value decomposition . Since , the linear map preserves the Euclidean norm. The square matrix is an orthogonal matrix, so . Consequently
Substitution into the expansion proves
Thus is a strongly convex function with modulus . This modulus is sharp: choose for an index attaining the smallest singular value. The Hessian matrix is , so the same conclusion says that its smallest eigenvalue is .

New to topics? Read the docs here!