✦ LIBER ✦

Composite projection algorithms for the split feasibility problem

✍ Scribed by Yonghong Yao; Pei-Xia Yang; Shin Min Kang

Book ID: 119323466
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 217 KB
Volume: 57
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2012.07.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modified projection methods for the spli

Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem

✍ Jinling Zhao; Yanjun Zhang; Qingzhi Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Incomplete projection algorithms for sol

Incomplete projection algorithms for solving the convex feasibility problem

✍ Ubaldo M. García-Palomares; Francisco J. González-Castaño 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 139 KB

Implicit and explicit algorithms for sol

Implicit and explicit algorithms for solving the split feasibility problem

✍ Xin Yu, Naseer Shahzad, Yonghong Yao 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

A new halfspace-relaxation projection me

A new halfspace-relaxation projection method for the split feasibility problem

✍ Biao Qu; Naihua Xiu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 150 KB

On descent-projection method for solving

On descent-projection method for solving the split feasibility problems

✍ Abdellah Bnouhachem, Muhammad Aslam Noor, Mohamed Khalfaoui, Sheng Zhaohan 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 182 KB

Cyclic algorithms for split feasibility

Cyclic algorithms for split feasibility problems in Hilbert spaces

✍ Fenghui Wang; Hong-Kun Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

The split common fixed point problem (SCFPP) is equivalently converted to a common fixed point problem of a finite family of class-T operators. This enables us to introduce new cyclic algorithms to solve the SCFPP and the multiple-set split feasibility problem.