Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets

DOI10.1080/01630560600791213zbMath1112.90059OpenAlexW2087295671MaRDI QIDQ3422787

Tuomo Valkonen

Publication date: 14 February 2007

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560600791213

zbMATH Keywords

convex optimizationincomplete dataWeiszfeld algorithmsuccessive over-relaxation

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85)

Related Items (5)

An Errata to: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ Clustering and the perturbed spatial median ⋮ Non-smooth SOR for \(L ^{1}\)-fitting: convergence study and discussion of related issues ⋮ Continuous reformulations and heuristics for the Euclidean travelling salesperson problem ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Accelerating convergence in the Fermat-Weber location problem
• Location of a moving service facility
• On the convergence of the Weiszfeld algorithm
• The convergence of the Weiszfeld algorithm
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Weber's problem and weiszfeld's algorithm in general spaces
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Stability of Difference Equations and Convergence of Iterative Processes
• A note on Fermat's problem

This page was built for publication: Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets