Problem 1: Consider the function f($1, 12) = $1 -12 + 2ri + 20142 + 17. Using the function f(21, 12) and an appropriate step-length, compute the first four itcrates r(1), z(2) r(3) and a(4) of the coordinate descent method starting with a) = (0,0) using a cyclic choice of coordinates. Hint: Watch the movie that discusses the coordinate descent methods presented at University of Washington by Prof Fox. Problem 2: Solve the following constrained optimisation problem: 5 min Z x? subject to J=1 + 212 + 13 =1; C3 - 204 + $5 = 6 Problem 3: Consider the following equality constrained optimisation problem min f(x) = -21 + 12 +5; subject to ri + 12 = 0