Article (Scientific journals)
A Lyusternik - Graves theorem for the proximal point method
Aragón Artacho, Francisco Javier; Gaydu, M.
2012In Computational Optimization and Applications, 52 (3), p. 785-803
Peer reviewed
 

Files


Full Text
aragon-gayduV07.pdf
Publisher postprint (205.28 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
proximal point algorithm; generalized equations; metric regularity
Abstract :
[en] 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 (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.
Research center :
Luxembourg Centre for Systems Biomedicine (LCSB): Systems Biochemistry (Fleming Group)
Disciplines :
Mathematics
Author, co-author :
Aragón Artacho, Francisco Javier ;  University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB)
Gaydu, M.
Language :
English
Title :
A Lyusternik - Graves theorem for the proximal point method
Publication date :
2012
Journal title :
Computational Optimization and Applications
Volume :
52
Issue :
3
Pages :
785-803
Peer reviewed :
Peer reviewed
Available on ORBilu :
since 15 November 2013

Statistics


Number of views
42 (5 by Unilu)
Number of downloads
0 (0 by Unilu)

Scopus citations®
 
4
Scopus citations®
without self-citations
3
OpenCitations
 
2
WoS citations
 
4

Bibliography


Similar publications



Contact ORBilu