A Lyusternik–Graves theorem for the proximal point method
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/29039
Registro completo de metadatos
| Campo DC | Valor | Idioma |
|---|---|---|
| dc.contributor | Laboratorio de Optimización (LOPT) | es |
| dc.contributor.author | Aragón Artacho, Francisco Javier | - |
| dc.contributor.author | Gaydu, Michaël | - |
| dc.contributor.other | Universidad de Alicante. Departamento de Estadística e Investigación Operativa | es |
| dc.date.accessioned | 2013-06-19T08:23:10Z | - |
| dc.date.available | 2013-06-19T08:23:10Z | - |
| dc.date.issued | 2011-10-01 | - |
| dc.identifier.citation | ARAGÓN ARTACHO, Francisco J.; GAYDU, Michaël. "A Lyusternik–Graves theorem for the proximal point method". Computational Optimization and Applications. Vol. 52, Issue 3 (July 2012). ISSN 0926-6003, pp. 785-803 | es |
| dc.identifier.issn | 0926-6003 (Print) | - |
| dc.identifier.issn | 1573-2894 (Online) | - |
| dc.identifier.uri | http://hdl.handle.net/10045/29039 | - |
| dc.description.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 (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. | es |
| dc.description.sponsorship | Research of the first author was partially supported by Ministerio de Ciencia e Innovación (Spain), grant MTM2008-06695-C03-01 and program “Juan de la Cierva”. Research of the second author was partially supported by Contract EA4540 (France). | es |
| dc.language | eng | es |
| dc.publisher | Springer Science+Business Media, LLC | es |
| dc.rights | The original publication is available at www.springerlink.com | es |
| dc.subject | Proximal point algorithm | es |
| dc.subject | Generalized equations | es |
| dc.subject | Perturbations | es |
| dc.subject | Metric regularity | es |
| dc.subject | Strong regularity | es |
| dc.subject.other | Estadística e Investigación Operativa | es |
| dc.subject.other | Análisis Matemático | es |
| dc.title | A Lyusternik–Graves theorem for the proximal point method | es |
| dc.type | info:eu-repo/semantics/article | es |
| dc.peerreviewed | si | es |
| dc.identifier.doi | 10.1007/s10589-011-9439-6 | - |
| dc.relation.publisherversion | http://dx.doi.org/10.1007/s10589-011-9439-6 | es |
| dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | es |
| Aparece en las colecciones: | INV - LOPT - Artículos de Revistas | |
Archivos en este ítem:
| Archivo | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
 2012_Aragon_Gaydu_ComputOptimAppl.pdf | Preprint (acceso abierto) | 190,7 kB | Adobe PDF | Abrir Vista previa |
 2012_Aragon_Gaydu_ComputOptimAppl_final.pdf | Versión final (acceso restringido) | 623,26 kB | Adobe PDF | Abrir Solicitar una copia |
Ver citas en Google Académico
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.