1. ## Gradient method problems - steepest conjugate etc.

I have three questions as a take home exam in my course.

(Problems in the jpeg file)

2. Originally Posted by trante
I have three questions as a take home exam in my course.

(Problems in the jpeg file)
Has your instructor said you can get help with this take home exam? The thread is closed pending further information (you can pm me).

3. Originally Posted by trante
I have three questions as a take home exam in my course.

(Problems in the jpeg file)

Originally Posted by trante
She noted that we can even ask to our graduate friends for help. This work will effect our grades %5.

[snip]

4. Originally Posted by trante
I have three questions as a take home exam in my course.

(Problems in the jpeg file)
2. get $x_{k+1}$ from $x_k$ you must use $Q$ to evaluate $g_k$ and $Qg_k$

5. ## Steepest descent

*Q1 Show the direction vectors are perpendicular to each other in the Steepest Descent Method;
that is
$g_{k+1}^t * g_k=0$

I know that in steepest descent, the algorithm makes zigzags.
If one vector is A and the other is B.
And the angle between them is $\theta$.
In vector multiplication $A*B=AB*cos \theta$
Because of $cos(90)=0$ the answer is 0.

But how can i relate it with steepest descent??