The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/92793
| Título: | The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators |
|---|---|
| Autor/es: | Aragón Artacho, Francisco Javier | Censor, Yair | Gibali, Aviv |
| Grupo/s de investigación o GITE: | Laboratorio de Optimización (LOPT) |
| Centro, Departamento o Servicio: | Universidad de Alicante. Departamento de Matemáticas |
| Palabras clave: | Douglas–Rachford | Reflections | Feasibility problems | r-sets-Douglas–Rachford operator |
| Área/s de conocimiento: | Estadística e Investigación Operativa |
| Fecha de publicación: | 2019 |
| Editor: | Taylor & Francis |
| Cita bibliográfica: | Optimization Methods and Software. 2019, 34(4): 875-889. doi:10.1080/10556788.2018.1504049 |
| Resumen: | The Douglas–Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows to use r-sets-DR operators in a cyclic fashion. We prove convergence and present numerical illustrations of the potential advantage of such operators with r>2 over the classical 2-sets-DR operators in a cyclic algorithm. |
| Patrocinador/es: | The first author was supported by MINECO of Spain and ERDF of EU, as part of the Ramón y Cajal program (RYC-2013-13327) and the Grant MTM2014-59179-C2-1-P. The second author’s work was supported by research grant no. 2013003 of the United States-Israel Binational Science Foundation (BSF). The third author’s work was supported by the EU FP7 IRSES program STREVCOMS, grant no. PIRSES-GA-2013-612669. |
| URI: | http://hdl.handle.net/10045/92793 |
| ISSN: | 1055-6788 (Print) | 1029-4937 (Online) |
| DOI: | 10.1080/10556788.2018.1504049 |
| Idioma: | eng |
| Tipo: | info:eu-repo/semantics/article |
| Derechos: | © 2018 Informa UK Limited, trading as Taylor & Francis Group |
| Revisión científica: | si |
| Versión del editor: | https://doi.org/10.1080/10556788.2018.1504049 |
| Aparece en las colecciones: | Investigaciones financiadas por la UE INV - LOPT - Artículos de Revistas |
Archivos en este ítem:
| Archivo | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
 2019_Aragon_etal_OptimizMethSoft_final.pdf | Versión final (acceso restringido) | 1,62 MB | Adobe PDF | Abrir Solicitar una copia |
 2019_Aragon_etal_OptimizMethSoft_preprint.pdf | Preprint (acceso abierto) | 1,33 MB | Adobe PDF | Abrir Vista previa |
Ver citas en Google Académico
Todos los documentos en RUA están protegidos por derechos de autor. Algunos derechos reservados.