Recent results on Douglas-Rachford methods for combinatorial optimization problems

Please use this identifier to cite or link to this item: http://hdl.handle.net/10045/29043
Información del item - Informació de l'item - Item information
Title: Recent results on Douglas-Rachford methods for combinatorial optimization problems
Authors: Aragón Artacho, Francisco Javier | Borwein, Jonathan M. | Tam, Matthew K.
Research Group/s: Laboratorio de Optimización (LOPT)
Center, Department or Service: Universidad de Alicante. Departamento de Estadística e Investigación Operativa
Keywords: Convex feasibility algorithms | Douglas-Rachford methods | Combinatorial optimization problems
Knowledge Area: Estadística e Investigación Operativa | Análisis Matemático
Issue Date: 17-May-2013
Publisher: Springer Science+Business Media New York
Citation: Journal of Optimization Theory and Applications. 2013, Dec. doi:10.1007/s10957-013-0488-0
Abstract: We discuss recent positive experiences applying convex feasibility algorithms of Douglas-Rachford type to highly combinatorial and far from convex problems.
URI: http://hdl.handle.net/10045/29043
ISSN: 0022-3239 (Print) | 1573-2878 (Online)
DOI: 10.1007/s10957-013-0488-0
Language: eng
Type: info:eu-repo/semantics/article
Rights: The final publication is available at Springer via http://dx.doi.org/10.1007/s10957-013-0488-0
Peer Review: si
Publisher version: http://dx.doi.org/10.1007/s10957-013-0488-0
Appears in Collections:INV - LOPT - Artículos de Revistas

Files in This Item:
Files in This Item:
File Description SizeFormat 
Thumbnail2013_Aragon_etal_2.pdfPreprint (acceso abierto)873,33 kBAdobe PDFOpen Preview
Thumbnail2013_Aragon_etal_JOTA_final.pdfVersión final (acceso restringido)1,36 MBAdobe PDFOpen    Request a copy


Items in RUA are protected by copyright, with all rights reserved, unless otherwise indicated.