Photo by aleexcif from unsplash
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… Click to show full abstract
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.
Keywords:
algorithm;
proximal penalization;
algorithm modified;
penalization algorithm;
modified multiple;
alternating proximal
Journal Title: Journal of Inequalities and Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Inequalities and Applications
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!