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

Descripción completa

Detalles Bibliográficos
Autor principal: Wang, Xueyong
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Research
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

Internet

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