Example 2. Use the
taxi-cab method to find the minimum of .
Enter the function .
Then perform the iterations using the subroutine TaxiCab.
Observe that in each iteration of the
taxi-cab method only one variable in the point is
Convergence proceeds a polygonal path where the segments are parallel to the coordinate axes.
The 3D plot of the points involved in the iteration is given below.
Let us compare this answer with Mathematica's built in procedure FindMinimum.
(c) John H. Mathews 2004