Maximal Monotone Operators and the Proximal Point Algorithm

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

Chapter Chapter 11 in Numerical Optimization with Computational Errors, 2016, pp 169-181 from Springer

Abstract: Abstract In a finite-dimensional Euclidean space, we study the convergence of a proximal point method to a solution of the inclusion induced by a maximal monotone operator, under the presence of computational errors. The convergence of the method is established for nonsummable computational errors. We show that the proximal point method generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.

Date: 2016
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-30921-7_11

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

DOI: 10.1007/978-3-319-30921-7_11

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