An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) |
scientific article |
Statements
An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (English)
0 references
14 January 2001
0 references
projection algorithms
0 references
Euclidean distance
0 references
nonexpansive operators
0 references
convex polyhedra
0 references
local search
0 references
polyhedra
0 references
0 references
0 references
