Finding a best approximation pair of points for two polyhedra (Q1616942): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129490742, #quickstatements; #temporary_batch_1724796091478 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-018-0021-3 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-018-0021-3 / rank | |||
Normal rank | |||
Latest revision as of 22:51, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a best approximation pair of points for two polyhedra |
scientific article |
Statements
Finding a best approximation pair of points for two polyhedra (English)
0 references
7 November 2018
0 references
best approximation pair
0 references
convex polyhedra
0 references
alternating projections
0 references
half-spaces
0 references
Cheney-Goldstein theorem
0 references
Halpern-Lions-Wittmann-Bauschke algorithm
0 references
0 references
0 references
0 references
0 references
0 references
