Accelerating convergence in minisum location problem with \(\ell p\) norms
From MaRDI portal
Publication:336624
DOI10.1016/j.cor.2013.05.015zbMath1348.90422OpenAlexW2006443439MaRDI QIDQ336624
Antonio M. Rodríguez-Chía, C. Valero-Franco, 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On solving the planar \(k\)-centrum problem with Euclidean distances
- The quadratic convergence of the topological epsilon algorithm for systems of nonlinear equations
- Local convergence in a generalized Fermat-Weber problem
- A note on the Weber location problem
- Aitken's and Steffensen's accelerations in several variables
- Convex ordered median problem with \(\ell _p\)-norms
- The single facility location problem with average-distances
- On the point for which the sum of the distances to \(n\) given points is minimum
- 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
- Some results about vector extrapolation methods and related fixed-point iterations
- 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
- On the convergence of a modified algorithm for the spherical facility location problem
- 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
- Location-Allocation Problems
- Weber's problem and weiszfeld's algorithm in general spaces
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- A New Distance Function for Modeling Travel Distances in a Transportation Network
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- 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
- A Fixed Point Method for Finding Percentage Points
- Link-Length Minimization in Networks
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- A note on Fermat's problem
- Convergence acceleration during the 20th century
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- Optimal location of a single facility with circular demand areas
This page was built for publication: Accelerating convergence in minisum location problem with \(\ell p\) norms