The parallel surrogate constraint approach to the linear feasibility problem
Author
Özaktaş, Hakan
Akgül, Mustafa
Pınar, Mustafa Ç.
Date
1996Source Title
Lecture Notes in Computer Science
Print ISSN
0302-9743
Publisher
Springer
Volume
1184
Pages
565 - 574
Language
English
Type
Conference PaperItem Usage Stats
174
views
views
147
downloads
downloads
Abstract
The linear feasibility problem arises in several areas of applied mathematics and medical science, in several forms of image reconstruction problems. The surrogate constraint algorithm of Yang and Murty for the linear feasibility problem is implemented and analyzed. The sequential approach considers projections one at a time. In the parallel approach, several projections are made simultaneously and their convex combination is taken to be used at the next iteration. The sequential method is compared with the parallel method for varied numbers of processors. Two improvement schemes for the parallel method are proposed and tested.
Keywords
Distributed computingLinear and convex feasibility
Parallel algorithms
Projection methods
Image reconstruction
Medical imaging
Medical problems
Optimization
Applied mathematics
Convex combinations
Convex feasibility
Feasibility problem
Sequential approach
Surrogate constraints
Iterative methods