Let be a strictly convex function defined for such that for any there exists so that if .
(i) Show that has a unique minimum .
(ii) Consider an ordinary differential equation
with some . Show that is a decreasing function of .
(iii) Show that converges to as . This is the gradient descent method.
(iv) Consider the function which is not strictly convex and is not differentiable at . Write down the explicit and implicit first order difference schemes for this ODE with a fixed time step . Does either of them converge to the minimum ? How does one cure that issue while keeping the time step fixed?