1

We want to find .

Rule we want to use:

Find the derivatives:

Since is scalar, it is equal to its own transpose: .

2

By definition of convexity, is convex since is symmetric positive semi-definite matrix and it admits a global minimum since it is a convex function.

3

Closed-form expression for this minimum :

Closed-form expression for excess cost function :

4

Expression of gradient of (as required):

5

Gradient descent iteration formula with step-size and gradient :

We are given that the error term is (where is the optimal solution). Given this we can state the recursion satisfied by :

Substitute and use .

Assume that , we have: