Cargando…
Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
In this paper, we present an extended alternating proximal penalization algorithm for the modified multiple-sets feasibility problem. For this method, we first show that the sequences generated by the algorithm are summable, which guarantees that the distance between two adjacent iterates converges...
Autor principal: | Wang, Xueyong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5820383/ https://www.ncbi.nlm.nih.gov/pubmed/29497268 http://dx.doi.org/10.1186/s13660-018-1641-y |
Ejemplares similares
-
An algorithm for the split-feasibility problems with application to the split-equality problem
por: Chuang, Chih-Sheng, et al.
Publicado: (2017) -
Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem
por: Zhao, Ying, et al.
Publicado: (2017) -
Breast Cancer Screening Using a Modified Inertial Projective Algorithms for Split Feasibility Problems
por: Nabheerong, Pennipat, et al.
Publicado: (2023) -
Modified Projection Algorithms for Solving the Split Equality Problems
por: Dong, Qiao-Li, et al.
Publicado: (2014) -
Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
por: Yu, Hai, et al.
Publicado: (2018)