On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem

DOI10.1287/OPRE.26.4.597zbMATH Open0396.90073DBLPjournals/ior/Ostresh78OpenAlexW1970928279WikidataQ29308166 ScholiaQ29308166MaRDI QIDQ4180147FDOQ4180147

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)

Cited In (58)

The geometric median and applications to robust mean estimation
Graphs with \(G^p\)-connected medians
Medians and means in Finsler geometry
On the robust PCA and Weiszfeld's algorithm
On the Fermat—Weber problem with convex cost functions
Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
An improved bound for the multifacility location model
An efficient noisy binary search in graphs via Median approximation
A generalized Weiszfeld method for the multi-facility location problem
Extensions to the planar \(p\)-median problem
Accelerating the convergence in the single-source and multi-source Weber problems
An optimal method for solving the (generalized) multi-Weber problem
Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993
Rotation averaging
A note on the Weber location problem
Local convergence in a generalized Fermat-Weber problem
On the convergence of the generalized Weiszfeld algorithm
An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
Robust and Scalable Bayes via a Median of Subset Posterior Measures
Single facility siting involving allocation decisions
Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
Optimal location on a sphere
A variable-penalty alternating directions method for convex optimization
A globally convergent algorithm for facility location on a sphere
Riemannian \(L^p\) averaging on Lie group of nonzero quaternions
A comparative study of heuristics for a two-level routing-location problem
Solution of location problems with radial cost functions
The inverse Fermat-Weber problem
Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
The Weiszfeld Algorithm: Proof, Amendments, and Extensions
Choosing among notions of multivariate depth statistics
Single facility location and relocation problem with time dependent weights and discrete planning horizon
A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
A graphic representation of the solution of the Weber problem in the space of the weights
Accelerating convergence in minisum location problem with \(\ell p\) norms
Weiszfeld's method: old and new results
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
On an open problem in spherical facility location
A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
Optimal location of a single facility with circular demand areas
Semi-obnoxious single facility location in Euclidean space.
A two-echelon joint continuous-discrete location model
Averaging Symmetric Positive-Definite Matrices
Location problems with costs being sums of powers of Euclidean distances
A new bounding method for single facility location models
On vector and matrix median computation
Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
Total cyclic variation and generalizations
Accelerating convergence in the Fermat-Weber location problem
Geometric median and robust estimation in Banach spaces
A globally convergent algorithm for the Euclidean multiplicity location problem
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
Probabilistic d-clustering
On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
The optimal solution set of the multi-source Weber problem
Medians in median graphs and their cube complexes in linear time

This page was built for publication: On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180147)