Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections

DOI10.1007/s00025-017-0721-5OpenAlexW3100531682WikidataQ59613487 ScholiaQ59613487MaRDI QIDQ2406495

Rhys Steele, Liam Stigant, Aashraya Jha, Oscar Darwin, David Seifert, Souktik Roy

Publication date: 4 October 2017

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.06144

zbMATH Keywords

complexityrate of convergenceorderingstravelling salesman problemsubspacesmethod of alternating projections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Iterative procedures involving nonlinear operators (47J25) Iterative numerical methods for linear systems (65F10)

Related Items (1)

On angles, projections and iterations

Cites Work

• Ritt operators and convergence in the method of alternating projections
• Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
• Error bounds for the method of alternating projections
• The rate of convergence for the method of alternating projections. II
• The rate of convergence in the method of alternating projections
• Best approximation in inner product spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-optimality of the greedy algorithm for subspace orderings in the method of alternating projections