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

DOI10.1007/BF01588313zbMath0433.65035MaRDI QIDQ3871838

Ulrich Eckhardt

Publication date: 1980

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

free boundary problemminimal surfacesoptimal locationWeber's problemWeiszfeld's algorithmlocal linear convergenceL1-approximation problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Inventory, storage, reservoirs (90B05) Best approximation, Chebyshev systems (41A50) Numerical solutions to equations with nonlinear operators (65J15)

Related Items

Location problems with costs being sums of powers of Euclidean distances, On an open problem in spherical facility location, Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993, Accelerating convergence in minisum location problem with \(\ell p\) norms, Rotation averaging, An efficient parallel scheme for minimizing a sum of Euclidean norms, Steiner minimal trees in \(L^ 2_ p\), Linear convergence of generalized Weiszfeld's method, On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\), Voting with rubber bands, weights, and strings, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Continuous location under the effect of `refraction', A quadratically convergent method for minimizing a sum of euclidean norms, Feature Matching with Bounded Distortion, A generalized Weiszfeld method for the multi-facility location problem, A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem, \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm, Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets, The Weiszfeld Algorithm: Proof, Amendments, and Extensions, A globally convergent algorithm for facility location on a sphere, Average linear least squares regression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a convex programming problem of Rozanov
• Variational problems with inequalities as boundary conditions or how to fashion a cheap hat for Giacometti's brother
• A dual-linear program
• Zur Statik eines gewissen FedersystemsE_n
• Local convergence in Fermat's problem
• A linear programming solution to the generalized rectangular distance weber problem
• Locating the vertices of a steiner tree in an arbitrary metric space
• CAPILLARITY PHENOMENA
• Convex Location Problems on Tree Networks
• A Least Total Distance Facility Configuration Problem Involving Lattice Points
• An equation for the paths in light guides with variable refractive index
• An Always-Convergent Numerical Scheme for a Random Locational Equilibrium Problem
• Technical Note—Location Theory: A Selective Bibliography
• Steiner Minimal Trees
• Numerical Solution of the Minimal Surface Equation
• A Note on Duality Theorem for a Nonlinear Programming Problem
• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
• A note on Fermat's problem
• Properties of a multifacility location problem involving euclidian distances
• Location Theory, Dominance, and Convexity