Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections (Q2406495)
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: Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections |
scientific article; zbMATH DE number 6785740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections |
scientific article; zbMATH DE number 6785740 |
Statements
Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections (English)
0 references
4 October 2017
0 references
method of alternating projections
0 references
orderings
0 references
subspaces
0 references
rate of convergence
0 references
travelling salesman problem
0 references
complexity
0 references
