Homework is about Unconstrained optimization. subject is Introduction to Operations research. My variant number is 13 and it's shown in the picture that I posted. I need answer urgently please. I'm waiting for your response. thank you so much in advance.

Minimize f (X1, X 2) = X, AX 2 + bx , 2 + cx , X2 + dx 2 2 Use any programing language of your preference Use constant lambda Run optimization for three different starting points Draw chart Optimality gap vs iterations Home . You can use Wolframalpha to explore function -work Vary values of lambda . Draw chart lambda vs number of iterations B C D E F G 1 b d 2 1 2 2 3 1 2 2 4 1 -1 2 5 1 4 6 2 4 7 4 4 8 10 10 9 10 -4 10 NNNNON N N N N N N N NON INN NNNN 10 -2 10 10 11 -2 5 5 12 1 2 13 1 2 14 1 2 15 1 4 16 2 NNN 4 17 4 4