The parallel surrogate constraint approach to the linear feasibility problem

DOI10.1007/3-540-62095-8_61MaRDI QIDQ4375655zbMATH OpenFDO

Authors Hakan Özaktaş, Mustafa Akgül, Mustafa Ç. Pınar

Publication date 1 March 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/27750

zbMATH Keywords

image reconstructionlinear feasibility problemparallel algorithmssurrogate constraint algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 176468
• Parallel image restoration using surrogate constraint methods
• Iterative method for solving the linear feasibility problem
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems

Cited in

(3)

• scientific article; zbMATH DE number 3961344 (Why is no real title available?)
• scientific article; zbMATH DE number 176468 (Why is no real title available?)
• Parallel image restoration using surrogate constraint methods

This page was built for publication: The parallel surrogate constraint approach to the linear feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375655)