Alternating CQ-Algorithms For Convex Feasibility And Split Fixed-Point Problems
AbstractDue to their extraordinary utility and broad applicability in many areas of applied mathematics (most notably, fully-discretized models of problems in image reconstruction from projections,in image processing, and in intensity-modulated radiation therapy),algorithms for solving convex feasibility problems continue to receive great attention.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by CEREGMIA, Université des Antilles et de la Guyane in its series Documents de Travail with number 2013-02.
Length: 10 pages
Date of creation: Feb 2013
Date of revision:
Contact details of provider:
Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex
Web page: http://www.ceregmia.eu/
More information through EDIRC
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Janis Hilaricus).
If references are entirely missing, you can add them using this form.