Alternating CQ-Algorithms For Convex Feasibility And Split Fixed-Point Problems
Due 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.
|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
When requesting a correction, please mention this item's handle: RePEc:crg:wpaper:dt2013-02. See general information about how to correct material in RePEc.
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.