UNCONSTRAINED MULTIVARIABLE OPTIMIZATION

← Back to document page

UNCONSTRAINED MULTIVARIABLE OPTIMIZATION ................................ Methods Using Function Values Only 183 ................................. Methods That Use First Derivatives 189 ........................................ ........ Newton's Method 197 ........................................ ... Quasi-Newton Methods 208 References ........................................ ............. 210 ........................................ Supplementary References 211 Problems.

At point 1, f(x) is greater than f at points .2 or 3. fixed for a given size simplex. Let us use a function of two variables to illustrate the procedure. At each iteration, to minimize f(x), f(x) is evaluated at each of three vertices of the triangle. The direction of search is oriented away from the point with the high-

  Points, Fixed, Iteration