On Newton's method for the Fermat-Weber location problem
From MaRDI portal
Publication:306303
DOI10.1007/s10957-016-0946-6zbMath1346.49042OpenAlexW2346151200MaRDI QIDQ306303
Simone Görner, Christian Kanzow
Publication date: 31 August 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0946-6
global convergenceNewton methodFermat-Weber location problemlocal quadratic convergenceWeiszfeld method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Newton-type methods (49M15)
Related Items (4)
Single facility siting involving allocation decisions ⋮ The optimal solution set of the multi-source Weber problem ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ Using the power of ideal solutions: simple proofs of some old and new results in location theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simple examples for the failure of Newton's method with line search for strictly convex minimization
- The Fermat-Torricelli problem. I: A discrete gradient-method approach
- Accelerating the convergence in the single-source and multi-source Weber problems
- Minsum location extended to gauges and to convex sets
- Applications of variational analysis to a generalized Fermat-Torricelli problem
- Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- Geometric methods and optimization problems
- The Fermat--Torricelli problem in normed planes and spaces
- Weiszfeld's method: old and new results
- Newton's iterates can converge to non-stationary points
- Optimization theory and methods. Nonlinear programming
- A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
- Introduction to Nonlinear Optimization
- Location Theory
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- Local convergence in Fermat's problem
- A Nonmonotone Line Search Technique for Newton’s Method
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- The Newton bracketing method for convex minimization.
This page was built for publication: On Newton's method for the Fermat-Weber location problem