A Regularized Algorithm for the Proximal Split Feasibility Problem

A Regularized Algorithm for the Proximal Split Feasibility Problem

The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Abstract and Applied Analysis 2014-01, Vol.2014 (2014), p.160-165-1517
Hauptverfasser: Zhu, Li-Jun, Kang, Shin Min, Cho, Sun Young, Yao, Zhangsong
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Colleges & universities
Convergence (Mathematics)
Mathematical research
Mathematics
Sequential scheduling
Task analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The proximal split feasibility problem has been studied. A regularized method has been presented for solving the proximal split feasibility problem. Strong convergence theorem is given.
ISSN:1085-3375
1687-0409
DOI:10.1155/2014/894272