Local convergence in Fermat's problem
- I. Norman Katz
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
The general Fermat problem is to find the minimum of the weighted sum of distances fromm destination points in Euclideann-space. Kuhn recently proved that a classical iterative algorithm converges to the unique minimizing point , for any choice of the initial point except for a denumerable set. In this note, it is shown that although convergence is global, the rapidity of convergence depends strongly upon whether or not is a destination.
If is not a destination, then locally convergence is always linear with upper and lower asymptotic convergence boundsλ andλ′ (λ ≥ 1/2, whenn=2). If is a destination, then convergence can be either linear, quadratic or sublinear. Three numerical examples which illustrate the different possibilities are given and comparisons are made with the use of Steffensen's scheme to accelerate convergence.
- L. Cooper, “Location—allocation problems”,Operations Research 11 (1963) 331–343.
- L. Cooper, “Heuristic methods for location—allocation problems”,SIAM Review 6 (1964) 37–52.
- L. Cooper, “Solutions of generalized locational equilibrium problems”,Journal of Regional Science 7 (1967) 1–18.
- L. Cooper, “An extension on the generalized Weber problem”,Journal of Regional Science 8 (1968) 181–197.
- L. Cooper, “Probabilistic location—allocation problems”, CS/OR Technical Rept. No. 72020, SMU, Dallas, Texas (March 1973).
- P. Henrici,Elements of numerical analysis (Wiley, New York, 1966).
- E. Isaacson and H.B. Keller,Analysis of numerical methods (Wiley, New York, 1966).
- I. Norman Katz, “On the convergence of a numerical scheme for solving some locational equilibrium problems”,SIAM Journal of Applied Mathematics 17 (1969) 1224–1231.
- I. Norman Katz and L. Cooper, “An always convergent numerical scheme for a random locational equilibrium problem”,SIAM Journal on Numerical Analysis, to appear.
- H.W. Kuhn, “A note on Fermat's problem”,Mathematical Programming 4 (1973) 98–107.
- H.W. Kuhn and R.E. Kuenne, “An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics”,Journal of Regional Science 4 (1962) 21–23.
- W. Miehle, “Link—length minimization in networks”,Operations Research 6 (1968) 232–243.
- J.M. Ortega and W.C. Rheinboldt,Iterative solution of nonlinear equations in several variables (Academic Press, New York, 1970).
- E. Weiszfeld, “Sur le point pour lequel la somme des distances den points donnés est minimum”,The Tôhoku Mathematical Journal 43 (1937) 355–386.
- Local convergence in Fermat's problem
Volume 6, Issue 1 , pp 89-104
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- I. Norman Katz (1)
- Author Affiliations
- 1. Washington University, St. Louis, Missouri, USA