2.8 Coordinate search applied to minimize a simple quadratic Compare five steps of the random search...

Transcribed Image Text:

2.8 Coordinate search applied to minimize a simple quadratic Compare five steps of the random search algorithm (with P = 1000 random directions tested at each step) to seven steps of coordinate search, using the same starting point w = [3 4] and fixed steplength parameter value a = 1 to minimize the quadratic function g(w₁,w₂) = w+w² + 2. (2.36) Plot this function along with the resulting runs of both algorithms, and describe any differences in behavior between the two runs. 2.8 Coordinate search applied to minimize a simple quadratic Compare five steps of the random search algorithm (with P = 1000 random directions tested at each step) to seven steps of coordinate search, using the same starting point w = [3 4] and fixed steplength parameter value a = 1 to minimize the quadratic function g(w₁,w₂) = w+w² + 2. (2.36) Plot this function along with the resulting runs of both algorithms, and describe any differences in behavior between the two runs.