A Lyusternik–Graves theorem for the proximal point method

Francisco Aragón Artacho () and Michaël Gaydu ()

Computational Optimization and Applications, 2012, vol. 52, issue 3, 785-803

Abstract: We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y∈T(x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point $({\bar{x}},0)$ in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove that they inherit the regularity properties of T, and vice versa. We analyze the cases when the mapping T is metrically regular and strongly regular. Copyright Springer Science+Business Media, LLC 2012

Keywords: Proximal point algorithm; Generalized equations; Perturbations; Metric regularity; Strong regularity (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-011-9439-6 (text/html)
Access to full text is restricted to subscribers.

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:coopap:v:52:y:2012:i:3:p:785-803

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-011-9439-6

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

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