On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) |
scientific article |
Statements
On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (English)
0 references
18 March 2013
0 references
The classical single facility location problem with \(\ell_p\) norm in dimension \(n\) is considered, for which no convergence results of the generalized Weiszfeld algorithm are known for \(p>2\). For such cases new stepsizes are developed for a hyperbolic \(\varepsilon\)-approximation of the problem guaranteeing convergence to the optimal solution. Using stepwise decreasing \(\varepsilon\) values and a diagonal argument a globally convergent algorithm is obtained for the original problem. Extensive numerical results show the effectiveness of the procedure.
0 references
Fermat-Weber problem
0 references
\(\ell_p\)-norm
0 references
Weiszfeld algorithm
0 references
global convergence
0 references
0 references
0 references
0 references
0 references
