1 resultado para Single-commodity capacitated network design problem
Filtro por publicador
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Archive On-line (Stockholm University; Sweden) (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (28)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (15)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (1)
- Aston University Research Archive (40)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (70)
- Biblioteca Digital de la Universidad Católica Argentina (1)
- Biblioteca Virtual del Sistema Sanitario Público de Andalucía (BV-SSPA), Junta de Andalucía. Consejería de Salud y Bienestar Social, Spain (6)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (13)
- Brock University, Canada (9)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- CaltechTHESIS (3)
- CentAUR: Central Archive University of Reading - UK (32)
- CiencIPCA - Instituto Politécnico do Cávado e do Ave, Portugal (3)
- Cochin University of Science & Technology (CUSAT), India (5)
- Coffee Science - Universidade Federal de Lavras (2)
- Consorci de Serveis Universitaris de Catalunya (CSUC), Spain (79)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (2)
- Digital Commons - Michigan Tech (4)
- Digital Commons - Montana Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (16)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (3)
- DigitalCommons@University of Nebraska - Lincoln (5)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (33)
- DRUM (Digital Repository at the University of Maryland) (7)
- Duke University (1)
- FUNDAJ - Fundação Joaquim Nabuco (3)
- Galway Mayo Institute of Technology, Ireland (3)
- Glasgow Theses Service (3)
- Helvia: Repositorio Institucional de la Universidad de Córdoba (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Institute of Public Health in Ireland, Ireland (1)
- Instituto Politécnico de Castelo Branco - Portugal (1)
- Instituto Politécnico de Viseu (1)
- Instituto Politécnico do Porto, Portugal (63)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (38)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Martin Luther Universitat Halle Wittenberg, Germany (2)
- Massachusetts Institute of Technology (4)
- Memorial University Research Repository (1)
- National Center for Biotechnology Information - NCBI (4)
- Nottingham eTheses (2)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (1)
- RDBU - Repositório Digital da Biblioteca da Unisinos (5)
- Repositorio Academico Digital UANL (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (17)
- Repositório da Produção Científica e Intelectual da Unicamp (2)
- Repositório de Administração Pública (REPAP) - Direção-Geral da Qualificação dos Trabalhadores em Funções Públicas (INA), Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (6)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (2)
- Repositório Institucional da Universidade Estadual de São Paulo - UNESP (1)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (52)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (33)
- Scielo España (1)
- Scielo Saúde Pública - SP (7)
- Scottish Institute for Research in Economics (SIRE) (SIRE), United Kingdom (5)
- Universidad de Alicante (4)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (48)
- Universidade Complutense de Madrid (1)
- Universidade do Minho (15)
- Universidade Federal do Rio Grande do Norte (UFRN) (7)
- Universitat de Girona, Spain (6)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (3)
- Université de Lausanne, Switzerland (67)
- Université de Montréal (1)
- Université de Montréal, Canada (22)
- Université Laval Mémoires et thèses électroniques (2)
- University of Michigan (16)
- University of Queensland eSpace - Australia (53)
- University of Southampton, United Kingdom (2)
- University of Washington (4)
- WestminsterResearch - UK (1)
Resumo:
We consider a linear precoder design for an underlay cognitive radio multiple-input multiple-output broadcast channel, where the secondary system consisting of a secondary base-station (BS) and a group of secondary users (SUs) is allowed to share the same spectrum with the primary system. All the transceivers are equipped with multiple antennas, each of which has its own maximum power constraint. Assuming zero-forcing method to eliminate the multiuser interference, we study the sum rate maximization problem for the secondary system subject to both per-antenna power constraints at the secondary BS and the interference power constraints at the primary users. The problem of interest differs from the ones studied previously that often assumed a sum power constraint and/or single antenna employed at either both the primary and secondary receivers or the primary receivers. To develop an efficient numerical algorithm, we first invoke the rank relaxation method to transform the considered problem into a convex-concave problem based on a downlink-uplink result. We then propose a barrier interior-point method to solve the resulting saddle point problem. In particular, in each iteration of the proposed method we find the Newton step by solving a system of discrete-time Sylvester equations, which help reduce the complexity significantly, compared to the conventional method. Simulation results are provided to demonstrate fast convergence and effectiveness of the proposed algorithm.