1 resultado para Combinatorial problem
em Universidad de Alicante
Filtro por publicador
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (6)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- Adam Mickiewicz University Repository (5)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- Aquatic Commons (26)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (8)
- Aston University Research Archive (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (1)
- Boston University Digital Common (9)
- Brock University, Canada (30)
- Bulgarian Digital Mathematics Library at IMI-BAS (9)
- CaltechTHESIS (15)
- Cambridge University Engineering Department Publications Database (73)
- CentAUR: Central Archive University of Reading - UK (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (43)
- Cochin University of Science & Technology (CUSAT), India (9)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Cornell: DigitalCommons@ILR (1)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (10)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (3)
- Digital Peer Publishing (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- FUNDAJ - Fundação Joaquim Nabuco (4)
- Funes: Repositorio digital de documentos en Educación Matemática - Colombia (1)
- Greenwich Academic Literature Archive - UK (28)
- Helda - Digital Repository of University of Helsinki (21)
- Indian Institute of Science - Bangalore - Índia (167)
- Instituto Politécnico do Porto, Portugal (20)
- Massachusetts Institute of Technology (7)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (8)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (136)
- Queensland University of Technology - ePrints Archive (225)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (9)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (18)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (9)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (1)
- Universidad Politécnica de Madrid (4)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (6)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (23)
- University of Queensland eSpace - Australia (3)
- WestminsterResearch - UK (1)
Resumo:
In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a combinatorial nature. For many of these problems current theory is not sufficient to explain this observed success and is mainly concerned with questions of local convergence. In this paper we analyze global behavior of the method for finding a point in the intersection of a half-space and a potentially non-convex set which is assumed to satisfy a well-quasi-ordering property or a property weaker than compactness. In particular, the special case in which the second set is finite is covered by our framework and provides a prototypical setting for combinatorial optimization problems.