implement the procedures (matlab) for minimization of the function f(x,y) using :

(1) Steepest descent (Cauchy) with Armijo line search;

(2) Fletcher-Reeves method Armijo line search;

(3) Newton Modified method armijo line search;

(4) Quasi-Newton Method (DFP & BFGS) Armijo line search;

such that the stationary point ( optimal point ) is achieved.

Plot on the (x,y) plane, the sequences of point generated by each algorithm. Are they convergence? if so, how many iterations has it be?

Implement the procedures (Matlab) for minimization of the function f(x,y) using: (1) Steepest descent (Cauchy) with Armijo line search; (2) Fletcher-Reeves Method Armijo line search; (3) Newton Modified Method Armijo line search; (4) Quasi-Newton Method (DFP & BFGS) Armijo line search; such that the stationary point (optimal point) is achieved. Plot on the (x,y) plane, the sequences of points generated by each algorithm. Are they convergence ? if so, how many iterations has it be