A learning-enhanced projection method for solving convex feasibility problems
- 1 January 2022
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 27 (1) , 555-568
Abstract
We propose a generalization of the method of cyclic projections, which uses the lengths of projection steps carried out in the past to learn about the geometry of the problem and decides on this basis which projections to carry out in the future. We prove the convergence of this algorithm and illustrate its behavior in a first numerical study.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomographyJournal of Computational and Applied Mathematics, 2015
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex SetsSIAM Journal on Optimization, 2014
- A Randomized Kaczmarz Algorithm with Exponential ConvergenceJournal of Fourier Analysis and Applications, 2008
- Convergence studies on iterative algorithms for image reconstructionIEEE Transactions on Medical Imaging, 2003
- Accelerating the convergence of the method of alternating projectionsTransactions of the American Mathematical Society, 2003
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- Convergence of sequential and asynchronous nonlinear paracontractionsNumerische Mathematik, 1992
- Acceleration schemes for the method of alternating projectionsJournal of Computational and Applied Mathematics, 1989
- On the von Neumann alternating algorithm in Hilbert spaceJournal of Mathematical Analysis and Applications, 1986
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981