Accelerating convergence in minisum location problem with p norms

DOI10.1016/J.COR.2013.05.015zbMATH Open1348.90422OpenAlexW2006443439MaRDI QIDQ336624FDOQ336624

Authors: C. Valero-Franco, Antonio M. Rodríguez-Chía, Inmaculada Espejo 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.015

Recommendations

• Accelerating convergence in the Fermat-Weber location problem
• The convergence of the Weiszfeld algorithm
• A note on accelerating the weiszfeld procedure
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• A note on convergence in the single facility minisum location problem

zbMATH Keywords

convergenceaccelerationlocation problem\(\ell p\)-normWeiszfeld algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Discrete location and assignment (90B80)

Cites Work

• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on Fermat's problem
• Location-Allocation Problems
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Fixed Point Method for Finding Percentage Points
• Link-Length Minimization in Networks
• Some results about vector extrapolation methods and related fixed-point iterations
• On the convergence of a modified algorithm for the spherical facility location problem
• Local convergence in Fermat's problem
• Local convergence in a generalized Fermat-Weber problem
• A note on the Weber location problem
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• On the point for which the sum of the distances to \(n\) given points is minimum
• Convex ordered median problem with \(\ell _p\)-norms
• The single facility location problem with average-distances
• The Steffensen iteration method for systems of nonlinear equations
• The Aitken-Steffensen formula for systems of nonlinear equations. III
• Location problems with costs being sums of powers of Euclidean distances
• Stepsize analysis for descent methods
• About Henrici's transformation for accelerating vector sequences
• Accelerating convergence in the Fermat-Weber location problem
• Location of a moving service facility
• On the convergence of the Weiszfeld algorithm
• Analysis of Henrici's transformation for singular problems
• The convergence of the Weiszfeld algorithm
• A note on convergence in the single facility minisum location problem
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• Minisum location with closest Euclidean distances
• Linear convergence for vector sequences and some applications
• The condition of Steffensen's acceleration in several variables
• The Fermat-Weber location problem revisited
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
• New models for locating a moving service facility
• Title not available (Why is that?)
• Weber's problem and weiszfeld's algorithm in general spaces
• A New Distance Function for Modeling Travel Distances in a Transportation Network
• Title not available (Why is that?)
• A note on accelerating the weiszfeld procedure
• General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Computation of the multivariate normal integral
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• Convergence acceleration during the 20th century
• Optimal location of a single facility with circular demand areas
• On solving the planar \(k\)-centrum problem with Euclidean distances
• The quadratic convergence of the topological epsilon algorithm for systems of nonlinear equations
• Aitken's and Steffensen's accelerations in several variables

Cited In (7)

• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• A branch-and-price approach for the continuous multifacility monotone ordered median problem
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
• Location with acceleration-deceleration distance
• Accelerating convergence in the Fermat-Weber location problem
• On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)

This page was built for publication: Accelerating convergence in minisum location problem with \(\ell p\) norms

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