1 resultado para Global Theory Of Media
em Universidad de Alicante
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (4)
- Adam Mickiewicz University Repository (2)
- Aquatic Commons (7)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (8)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (5)
- Boston University Digital Common (5)
- Brock University, Canada (11)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- CaltechTHESIS (17)
- Cambridge University Engineering Department Publications Database (83)
- CentAUR: Central Archive University of Reading - UK (107)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (53)
- Cochin University of Science & Technology (CUSAT), India (8)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (5)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (4)
- Deakin Research Online - Australia (159)
- Department of Computer Science E-Repository - King's College London, Strand, London (2)
- Digital Archives@Colby (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (1)
- Digital Peer Publishing (1)
- DigitalCommons - The University of Maine Research (1)
- Diposit Digital de la UB - Universidade de Barcelona (4)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (6)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (17)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (88)
- Instituto Politécnico do Porto, Portugal (2)
- Massachusetts Institute of Technology (9)
- Ministerio de Cultura, Spain (5)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (12)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (125)
- Queensland University of Technology - ePrints Archive (140)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (1)
- Research Open Access Repository of the University of East London. (1)
- RIBERDIS - Repositorio IBERoamericano sobre DIScapacidad - Centro Español de Documentación sobre Discapacidad (CEDD) (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 (2)
- School of Medicine, Washington University, United States (3)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad de Alicante (1)
- Universidad del Rosario, Colombia (2)
- Universidad Politécnica de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (14)
- University of Queensland eSpace - Australia (7)
- University of Southampton, United Kingdom (1)
- WestminsterResearch - UK (8)
- Worcester Research and Publications - Worcester Research and Publications - UK (3)
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.