A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
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 |
Revision as of 22:40, 29 June 2023
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