Weber's problem and weiszfeld's algorithm in general spaces

For solving the Euclidean distance Weber problem Weiszfeld proposed an iterative method. This method can also be applied to generalized Weber problems in Banach spaces. Examples for generalized Weber problems are: minimal surfaces with obstacles, Fermat's principle in geometrical optics and brachistochrones with obstacles.

[1]  E. I. Ershov,et al.  An equation for the paths in light guides with variable refractive index , 1976 .

[2]  Vidar Thomée,et al.  Error estimates for a finite element approximation of a minimal surface , 1975 .

[3]  R. Courant,et al.  Methoden der mathematischen Physik , .

[4]  R. L. Francis.  A Geometrical Solution Procedure for a Rectilinear Distance Minimax Location Problem1 , 1972 .

[5]  Johannes Thomas.  Zur Statik eines gewissen Federsystems En , 1961 .

[6]  David Sankoff,et al.  Locating the vertices of a steiner tree in an arbitrary metric space , 1975, Math. Program..

[7]  R. L. Francis,et al.  Technical Note - Location Theory: A Selective Bibliography , 1974, Oper. Res..

[8]  K. Nair,et al.  Optimal location of a single service center of certain types , 1971 .

[9]  U. Eckhardt.  On an optimization problem related to minimal surfaces with obstacles , 1975 .

[10]  Richard L. Francis,et al.  A Least Total Distance Facility Configuration Problem Involving Lattice Points , 1976 .

[11]  R. L. Francis,et al.  A Minimax Location Problem on a Network , 1974 .

[12]  S. S. Chadha.  A dual non-linear program , 1972 .

[13]  G. O. Wesolowsky,et al.  A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem , 1972 .

[14]  O V Titov.  MINIMAL HYPERSURFACES OVER SOFT OBSTACLES , 1974 .

[15]  Johannes C. C. Nitsche,et al.  Variational problems with inequalities as boundary conditions or How to fashion a cheap hat for giacometti's brother , 1969 .

[16]  F. Almgren,et al.  The Geometry of Soap Films and Soap Bubbles , 1976 .

[17]  Balakrishnan Dasarathy.  Some maxmin location and pattern separation problems: theory and algorithms. , 1975 .

[18]  I. Norman Katz,et al.  Local convergence in Fermat's problem , 1974, Math. Program..

[19]  L. Cooper,et al.  An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem , 1974 .

[20]  Timothy J. Lowe,et al.  Convex Location Problems on Tree Networks , 1976, Oper. Res..

[21]  R. Courant.  Dirichlet's Principle, Conformal Mapping, and Minimal Surfaces , 1950 .

[22]  George B. Dantzig,et al.  On a convex programming problem of Rozanov , 1974 .

[23]  J. W. Schmidt,et al.  L. Collatz, Funktionalanalysis und numerische Mathematik. (Die Grundlehren der mathematischen Wissenschaften, Band 120) VI + 371 S. m. 96 Abb. u. 2 Porträts. Berlin/Göttingen/Heidelberg 1964. Springer-Verlag. Preis geb. DM 58,— , 1965 .

[24]  H. Heinrich,et al.  G. Pólya, Mathematik und plausibles Schließen. Band 1. Induktion und Analogie in der Mathematik. 403 S. Basel und Stuttgart 1962. Birkhäuser Verlag. Preis geb. sFr. 38.– , 1963 .

[25]  Ulrich Eckhardt.  On a minimization problem in structural mechanics , 1978 .

[26]  Fasbender.  Über die gleichseitigen Dreiecke, welche um ein gegebenes Dreieck gelegt werden können. , 2022 .

[27]  Davinder Bhatia,et al.  A Note on Duality Theorem for a Nonlinear Programming Problem , 1970 .

[28]  P. Concus.  Numerical solution of the minimal surface equation , 1967 .

[29]  Harold W. Kuhn,et al.  A note on Fermat's problem , 1973, Math. Program..

[30]  D. Hearn,et al.  Geometrical Solutions for Some Minimax Location Problems , 1972 .

[31]  R. L. Francis,et al.  Properties of a multifacility location problem involving euclidian distances , 1972 .

[32]  James G. Morris.  A linear programming solution to the generalized rectangular distance weber problem , 1975 .

[33]  Richard E. Wendell,et al.  Location Theory, Dominance, and Convexity , 1973, Oper. Res..

[34]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[35]  John A. White,et al.  Some Properties of the Squared Euclidean Distance Location Problem1 , 1973 .