Dynamic String-Averaging Proximal Point Algorithm

Alexander J. Zaslavski
Additional contact information
Alexander J. Zaslavski: Technion:Israel Institute of Technology

Chapter Chapter 7 in Algorithms for Solving Common Fixed Point Problems, 2018, pp 255-279 from Springer

Abstract: Abstract In a Hilbert space, we study the convergence of a dynamic string-averaging proximal point method to a common zero of a finite family of maximal monotone operators under the presence of perturbations. Our main goal is to obtain an approximate solution of the problem using perturbed algorithms. We show that the inexact dynamic string-averaging proximal point algorithm generates an approximate solution if perturbations are summable. We also show that if the perturbations are sufficiently small, then the inexact produces approximate solutions.

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-77437-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9783319774374

DOI: 10.1007/978-3-319-77437-4_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().