Algorithms for linear and convex feasibility problems: A brief study of iterative projection, localization and subgradient methods
Item Usage Stats
MetadataShow full item record
Several algorithms for the feasibility problem are investigated. For linear systems, a number of different block projections approaches have been implemented and compared. The parallel algorithm of Yang and Murty is observed to be much slower than its sequential counterpart. Modification of the step size has allowed us to obtain a much better algorithm, exhibiting considerable speedup when compared to the sequential algorithm. For the convex feasibility problem an approach combining rectangular cutting planes and subgradients is developed. Theoretical convergence results are established for both ca^es. Two broad classes of image recovery problems are formulated as linear feasibility problems and successfully solved with the algorithms developed.
regularization of ill conditioned problems
image reconstruction from projections
central cutting (localization) methods
sequential and parallel algorithms
constraints and block projections
the relaxation (successive orthogonal projections) method
T57.74 .O93 1998
Relaxation methods (Mathematics).
Showing items related by title, author, creator and subject.
Dayar, T. (2009)Kronecker products are used to define the underlying Markov chain (MC) in various modeling formalisms, including compositional Markovian models, hierarchical Markovian models, and stochastic process algebras. The motivation ...
Alatan, A.A.; Erdem, A.T.; Onural L. (1997)We propose a novel method for estimating the 3D motion and dense structure of an object form its two 2D images. The proposed method is an iterative algorithm based on the theory of projections onto convex sets (POCS) that ...
Kose, K.; Cevher V.; Cetin, A.E. (2012)We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by ...