A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
The Weber problem is to find a point in \(\mathbb{R}^n\) that minimizes the weighted sum of Euclidean distances from the \(m\) given points, that is to find \[ \text{argmin} f(x)\qquad\text{subject to }x\in\mathbb{R}^n, \] where \(f\) is called the Weber function and it is defined by \[ f(x)= \sum^m_{j=1} w_j\| x- a_j\|. \] The authors generalize the Weber problem considering box constraints and propose a fixed-point iteration with projections on the constraints and demonstrate descending properties. Numerical experiments are given. | |||
Property / review text: The Weber problem is to find a point in \(\mathbb{R}^n\) that minimizes the weighted sum of Euclidean distances from the \(m\) given points, that is to find \[ \text{argmin} f(x)\qquad\text{subject to }x\in\mathbb{R}^n, \] where \(f\) is called the Weber function and it is defined by \[ f(x)= \sum^m_{j=1} w_j\| x- a_j\|. \] The authors generalize the Weber problem considering box constraints and propose a fixed-point iteration with projections on the constraints and demonstrate descending properties. Numerical experiments are given. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans Benker / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6043909 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Weber problem | |||
Property / zbMATH Keywords: Weber problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
box constraints | |||
Property / zbMATH Keywords: box constraints / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed-point iteration | |||
Property / zbMATH Keywords: fixed-point iteration / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
location problems | |||
Property / zbMATH Keywords: location problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Weiszfeld algorithm | |||
Property / zbMATH Keywords: Weiszfeld algorithm / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2011.08.041 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2029755646 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4229604 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352313 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A subgradient algorithm for certain minimax and minisum problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5574527 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A quadratically convergent method for minimizing a sum of euclidean norms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the point for which the sum of the distances to \(n\) given points is minimum / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on Fermat's problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fermat-Weber location problem revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the convergence of the Weiszfeld algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Further notes on convergence of the Weiszfeld algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Weber problem with regional demand / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local convergence in a generalized Fermat-Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accelerating convergence in the Fermat-Weber location problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sensitivity analysis to the value of \(p\) of the \({\ell}_p\) distance Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Duality theorem for a generalized Fermat-Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New heuristic methods for the capacitated multi-facility Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Location of a facility minimizing nuisance to or from a planar network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A guided reactive GRASP for the capacitated multi-source Weber problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the convergence of the generalized Weiszfeld algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A BSSS algorithm for the single facility location problem in two regions with different norms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A primal-dual algorithm for the fermat-weber problem involving mixed gauges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The linearized version of an algorithm for the mixed norms problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A destination optimality in asymmetric distance Fermat-Weber problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for facility location in the presence of forbidden regions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient solution method for Weber problems with barriers based on genetic algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The multi-facility location-allocation problem with polyhedral barriers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4788111 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for the solution of a location problem with metric constraints / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:15, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A projected Weiszfeld algorithm for the box-constrained Weber location problem |
scientific article |
Statements
A projected Weiszfeld algorithm for the box-constrained Weber location problem (English)
0 references
8 June 2012
0 references
The Weber problem is to find a point in \(\mathbb{R}^n\) that minimizes the weighted sum of Euclidean distances from the \(m\) given points, that is to find \[ \text{argmin} f(x)\qquad\text{subject to }x\in\mathbb{R}^n, \] where \(f\) is called the Weber function and it is defined by \[ f(x)= \sum^m_{j=1} w_j\| x- a_j\|. \] The authors generalize the Weber problem considering box constraints and propose a fixed-point iteration with projections on the constraints and demonstrate descending properties. Numerical experiments are given.
0 references
Weber problem
0 references
box constraints
0 references
fixed-point iteration
0 references
location problems
0 references
Weiszfeld algorithm
0 references
0 references
0 references
0 references
0 references