On Newton's method for the Fermat-Weber location problem

DOI10.1007/S10957-016-0946-6MaRDI QIDQ306303zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

global convergenceNewton methodWeiszfeld methodFermat-Weber location problemlocal quadratic convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Newton-type methods (49M15)

Recommendations

• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• scientific article; zbMATH DE number 1131789
• The Fermat-Weber location problem revisited
• Local convergence in a generalized Fermat-Weber problem
• Noniterative solution of some Fermat-Weber location problems

Cites work

• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
• A Nonmonotone Line Search Technique for Newton’s Method
• A generalized Sylvester problem and a generalized Fermat-Torricelli problem
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• A projected newton method forl p norm location problems
• A quadratically convergent method for minimizing a sum of euclidean norms
• Accelerating the convergence in the single-source and multi-source Weber problems
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
• Geometric methods and optimization problems
• Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
• Local convergence in Fermat's problem
• Location theory. A unified approach
• Minsum location extended to gauges and to convex sets
• Newton's iterates can converge to non-stationary points
• Optimization theory and methods. Nonlinear programming
• Simple examples for the failure of Newton's method with line search for strictly convex minimization
• The Fermat--Torricelli problem in normed planes and spaces
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• The Newton bracketing method for convex minimization.
• Weiszfeld's method: old and new results

Cited in

(16)

• Accelerating the convergence in the single-source and multi-source Weber problems
• A semismooth Newton based augmented Lagrangian algorithm for Weber problem
• Using the power of ideal solutions: simple proofs of some old and new results in location theory
• Single facility siting involving allocation decisions
• Efficient methods for goal square Weber location problem
• Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems
• The Newton bracketing method for convex minimization.
• Newton’s Method for the Ellipsoidal l p Norm Facility Location Problem
• Noniterative solution of some Fermat-Weber location problems
• A polynomial time algorithm for solving the fermat-weber location problem with mixed norms
• Computational Comparison of Two Algorithms for the Euclidean Single Facility Location Problem
• A Solution to the Weber Location Problem on the Sphere
• A trajectory based heuristic for the planar \(p\)-median problem
• Algebraic optimization: The Fermat-Weber location problem
• The Fermat-Weber location problem revisited
• The optimal solution set of the multi-source Weber problem

This page was built for publication: On Newton's method for the Fermat-Weber location problem

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