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

DOI10.1007/S10957-016-0946-6zbMATH Open1346.49042OpenAlexW2346151200MaRDI QIDQ306303FDOQ306303

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

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

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)

Cites Work

• Title not available (Why is that?)
• Optimization theory and methods. Nonlinear programming
• A quadratically convergent method for minimizing a sum of euclidean norms
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• A Nonmonotone Line Search Technique for Newton’s Method
• Location theory. A unified approach
• Title not available (Why is that?)
• Weiszfeld's method: old and new results
• Minsum location extended to gauges and to convex sets
• Accelerating the convergence in the single-source and multi-source Weber problems
• Local convergence in Fermat's problem
• Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
• 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
• Newton's iterates can converge to non-stationary points
• A generalized Sylvester problem and a generalized Fermat-Torricelli problem
• Simple examples for the failure of Newton's method with line search for strictly convex minimization
• Title not available (Why is that?)
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• A projected newton method forl p norm location problems
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• The Newton bracketing method for convex minimization.

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
• Efficient methods for goal square Weber location problem
• Single facility siting involving allocation decisions
• 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)