Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
From MaRDI portal
(Redirected from Publication:3422787)
Recommendations
Cites work
- A note on Fermat's problem
- Accelerating convergence in the Fermat-Weber location problem
- Cluster analysis.
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- scientific article; zbMATH DE number 4088699 (Why is no real title available?)
- Location of a moving service facility
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the convergence of the Weiszfeld algorithm
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Stability of Difference Equations and Convergence of Iterative Processes
- The convergence of the Weiszfeld algorithm
- Weber's problem and weiszfeld's algorithm in general spaces
Cited in
(6)- Levels of nonoptimality of the Weiszfeld algorithm in the least-modules method
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
- The Weiszfeld Algorithm: Proof, Amendments, and Extensions
- Clustering and the perturbed spatial median
- Non-smooth SOR for \(L ^{1}\)-fitting: convergence study and discussion of related issues
This page was built for publication: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422787)