The parallel surrogate constraint approach to the linear feasibility problem

Simple item page
dc.citation.epage574en_US
dc.citation.spage565en_US
dc.citation.volumeNumber1184en_US
dc.contributor.authorÖzaktaş, Hakanen_US
dc.contributor.authorAkgül, Mustafaen_US
dc.contributor.authorPınar, Mustafa Ç.en_US
dc.coverage.spatialLyngby, Denmarken_US
dc.date.accessioned2016-02-08T12:00:51Zen_US
dc.date.available2016-02-08T12:00:51Zen_US
dc.date.issued1996en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionDate of Conference: 18-21 August 1996en_US
dc.descriptionConference Name: 3rd International Workshop on Applied Parallel Computing, PARA 1996en_US
dc.description.abstractThe 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:00:51Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1996en
dc.identifier.doi10.1007/3-540-62095-8_61en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11693/27750en_US
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/3-540-62095-8_61en_US
dc.source.titleLecture Notes in Computer Scienceen_US
dc.subjectDistributed computingen_US
dc.subjectLinear and convex feasibilityen_US
dc.subjectParallel algorithmsen_US
dc.subjectProjection methodsen_US
dc.subjectImage reconstructionen_US
dc.subjectMedical imagingen_US
dc.subjectMedical problemsen_US
dc.subjectOptimizationen_US
dc.subjectApplied mathematicsen_US
dc.subjectConvex combinationsen_US
dc.subjectConvex feasibilityen_US
dc.subjectFeasibility problemen_US
dc.subjectSequential approachen_US
dc.subjectSurrogate constraintsen_US
dc.subjectIterative methodsen_US
dc.titleThe parallel surrogate constraint approach to the linear feasibility problemen_US
dc.typeConference Paperen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
The parallel surrogate constraint approach to the linear feasibility problem.pdf
Size:
543.49 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Industrial Engineering