The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7212184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Douglas-Rachford algorithm for convex and nonconvex feasibility problems |
scientific article; zbMATH DE number 7212184 |
Statements
The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (English)
0 references
15 June 2020
0 references
The feasibility problem is to find a point contained in the intersection of a finite collection of constraint sets. This paper is a tutorial on the Douglas-Rachford algorithm for solving convex and nonconvex feasibility problems for the unacquainted. Several known projection algorithms, particularly the Douglas-Rachford method, are analyzed. The Douglas-Rachford method is applied to solve the combinatorial \((m, n)\)-queens problem as well as the problem of constructing a probability distribution with prescribed moments.
0 references
projection methods
0 references
Douglas-Rachford
0 references
feasibility problem
0 references
eight queens problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8672469854354858
0 references
0.8582563996315002
0 references
0.8577907085418701
0 references
0.8453052043914795
0 references
0.8385475277900696
0 references
