| Gradient Search Procedure - Introduction | Previous | Next |
| To illustrate the gradient search procedure, consider the following two-variable unconstrained optimization problem for a concave function. |
| The partial derivatives are |
![]() |
| So the gradient of |
| The optimal solution will turn out to be |
| |
| Now let us see how the gradient search procedure obtains this solution. |