An algorithm for solving the nearest point problem in an affine subspace (Q842297)
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 algorithm for solving the nearest point problem in an affine subspace |
scientific article; zbMATH DE number 5606220
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for solving the nearest point problem in an affine subspace |
scientific article; zbMATH DE number 5606220 |
Statements
An algorithm for solving the nearest point problem in an affine subspace (English)
0 references
22 September 2009
0 references
successive orthogonal projections algorithm
0 references
linear convergence
0 references
convex feasibility problem
0 references
0.7820351123809814
0 references
0.7814614772796631
0 references
0.7697595357894897
0 references
0.7687615156173706
0 references
0.7683380246162415
0 references
