Alternating CQ-Algorithms For Convex Feasibility And Split Fixed-Point Problems

Abdellatif Moudafi ()
Additional contact information
Abdellatif Moudafi: Ceregmia,Département Scientifique Interfacultaire

No 2013-02, Documents de Travail from CEREGMIA, Université des Antilles et de la Guyane

Abstract: 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.

Pages: 10 pages
Date: 2013-02
New Economics Papers: this item is included in nep-cmp
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www2.univ-ag.fr/RePEc/DT/DT2013-02_Moudafi.pdf First version,2013 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:crg:wpaper:dt2013-02

Access Statistics for this paper

More papers in Documents de Travail from CEREGMIA, Université des Antilles et de la Guyane Contact information at EDIRC.
Bibliographic data for series maintained by Janis Hilaricus ().