A globally convergent algorithm for the Euclidean multiplicity location problem

DOI10.1007/BF02006744zbMath0779.90064MaRDI QIDQ1210269

Guoliang Xue, J. Ben Rosen

Publication date: 24 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

nonsmooth convex programmingEuclidean multiplicity locationEuclidean single facility location

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Minimization of functions having Lipschitz continuous first partial derivatives
• A quadratically convergent method for minimizing a sum of euclidean norms
• A projected newton method forl p norm location problems
• The Euclidean Multifacility Location Problem
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
• On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on optimality conditions for the Euclidean. Multifacility location problem
• Technical Note—Location Theory: A Selective Bibliography
• Convex Analysis
• A note on Fermat's problem
• Properties of a multifacility location problem involving euclidian distances
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item