Transcription of METHOD OF QUADRATIC INTERPOLATION
{{id}} {{{paragraph}}}
METHOD OF QUADRATIC INTERPOLATIONKELLER methods are a common approach to the more generalarea of line search for optimization. In the case of QUADRATIC inter-polation, the function s critical value is bracketed, and a quadraticinterpolant is fitted to the arc contained in the interval. Then, theinterpolant is minimized, and the new interval is determined based onthe relation of the minimizer to the original endpoints of the more formally, letx* maximize (or minimize)f(x). Ifx* isnot easily found through analytic methods, then it is significantly eas-ier to bracket the interval over which this critical point occurs. Letq(x) denote the QUADRATIC interpolant off(x). Minimizing a quadraticfunction is trivial, and so the critical point ofqis easily obtained. Wethen form a new bracketing interval by throwing away the worst point, which for our purposes would be the point that is the largest orsmallest, depending on whether we want to approximate a maximumor minimum.
But this is precisely the iteration de ned by Newton’s method. This motivates calling (2.7) the secant method, because it is just Newton’s method with the secant approximation of f00(x k) instead. 2.3. Method 3. Our third method is the 3 point method. Choose 3 points, 2 endpoints to bracket our critical point, and then a point
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}