Linear Convergence of Projection Algorithms

Linear Convergence of Projection Algorithms

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice owing to minimal requirements for software implementation and maintenance. In this work, we study linear convergence of several projection algorithms...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics of operations research 2019-05, Vol.44 (2), p.715-738
Hauptverfasser: Dao, Minh N, Phan, Hung M
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Convergence
Convergence (Mathematics)
cyclic projections
Douglas–Rachford algorithm
Feasibility
injectable set
linear convergence
linear regularity
Mathematical research
Operations research
Projection
quasi coercivity
quasi firm Fejér monotonicity
reflection-projection algorithm
semi-intrepid projection
strong regularity
superregularity
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice owing to minimal requirements for software implementation and maintenance. In this work, we study linear convergence of several projection algorithms for systems of finitely many closed sets. The results complement contemporary research on the same topic.
ISSN:0364-765X
1526-5471
DOI:10.1287/moor.2018.0942