Accelerating convergence in minisum location problem with p norms
From MaRDI portal
(Redirected from Publication:336624)
Accelerating convergence in minisum location problem with \(\ell p\) norms
Accelerating convergence in minisum location problem with \(\ell p\) norms
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
Cites work
- scientific article; zbMATH DE number 4026686 (Why is no real title available?)
- scientific article; zbMATH DE number 108341 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1253061 (Why is no real title available?)
- A Fixed Point Method for Finding Percentage Points
- A New Distance Function for Modeling Travel Distances in a Transportation Network
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- A note on accelerating the weiszfeld procedure
- A note on convergence in the single facility minisum location problem
- A note on the Weber location problem
- About Henrici's transformation for accelerating vector sequences
- Accelerating convergence in the Fermat-Weber location problem
- Aitken's and Steffensen's accelerations in several variables
- Analysis of Henrici's transformation for singular problems
- Computation of the multivariate normal integral
- Convergence acceleration during the 20th century
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- Convex ordered median problem with \(\ell _p\)-norms
- 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
- Linear convergence for vector sequences and some applications
- Link-Length Minimization in Networks
- Local convergence in Fermat's problem
- Local convergence in a generalized Fermat-Weber problem
- Location of a moving service facility
- Location problems with costs being sums of powers of Euclidean distances
- Location-Allocation Problems
- Minisum location with closest Euclidean distances
- New models for locating a moving service facility
- On solving the planar \(k\)-centrum problem with Euclidean distances
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
- On the convergence of a modified algorithm for the spherical facility location problem
- On the convergence of the Weiszfeld algorithm
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\)
- On the point for which the sum of the distances to \(n\) given points is minimum
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Optimal location of a single facility with circular demand areas
- Some results about vector extrapolation methods and related fixed-point iterations
- Stepsize analysis for descent methods
- The Aitken-Steffensen formula for systems of nonlinear equations. III
- The Fermat-Weber location problem revisited
- The Steffensen iteration method for systems of nonlinear equations
- The condition of Steffensen's acceleration in several variables
- The convergence of the Weiszfeld algorithm
- The quadratic convergence of the topological epsilon algorithm for systems of nonlinear equations
- The single facility location problem with average-distances
- Weber's problem and weiszfeld's algorithm in general spaces
Cited in
(7)- 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\)
- Location with acceleration-deceleration distance
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
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)
