An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) (Q1591950)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) |
scientific article; zbMATH DE number 1550659
| 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; zbMATH DE number 1550659 |
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
0.91935056
0 references
0.8936748
0 references
0.87548137
0 references
0.87518555
0 references
0.8717752
0 references
0.8668502
0 references
0.8614011
0 references
0.86030537
0 references
0.8579997
0 references
0.8576818
0 references
