SUMT - First Iteration | Previous | Next |
![]() |
|
When the above unconstrained optimization problem is solved using the gradient search procedure, the following new trial solution is found: | ![]() |
![]() |
|
Second iteration: For the next iteration, we will decrease the
value of ![]() ![]() |