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
_version_ 1783301355879792640
author Wang, Xueyong
author_facet Wang, Xueyong
author_sort Wang, Xueyong
collection PubMed
description 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 to zero, and then we establish the global convergence of the algorithm provided that the penalty parameter tends to zero.
format Online
Article
Text
id pubmed-5820383
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher Springer International Publishing
record_format MEDLINE/PubMed
spelling pubmed-58203832018-02-27 Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems Wang, Xueyong J Inequal Appl Research 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 to zero, and then we establish the global convergence of the algorithm provided that the penalty parameter tends to zero. Springer International Publishing 2018-02-20 2018 /pmc/articles/PMC5820383/ /pubmed/29497268 http://dx.doi.org/10.1186/s13660-018-1641-y Text en © The Author(s) 2018 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
spellingShingle Research
Wang, Xueyong
Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title_full Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title_fullStr Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title_full_unstemmed Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title_short Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
title_sort alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
topic Research
url 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
work_keys_str_mv AT wangxueyong alternatingproximalpenalizationalgorithmforthemodifiedmultiplesetssplitfeasibilityproblems

Ejemplares similares