Výsledky vyhľadávania - "difference‐of‐two convex functions"

  1. 1

    User capacity for uplink SCMA system Autor Gamal, Doaa, Mehana, Ahmed Hesham, Elsayed, Khaled M.F.

    ISSN: 1874-4907, 1876-3219
    Vydavateľské údaje: Elsevier B.V 01.04.2020
    Vydané v Physical communication (01.04.2020)
    “…: what is the maximum number of users that can be admitted in uplink SCMA subject to user-rate constraints? This is termed “user capacity…”
    Získať plný text
    Journal Article
  2. 2

    Cooperative MIMO relay beamforming in overloaded DS/CDMA multicast networks Autor Mehrizi, Sajad, Mahboobi, Behrad

    ISSN: 1751-8628, 1751-8636
    Vydavateľské údaje: The Institution of Engineering and Technology 16.02.2017
    Vydané v IET communications (16.02.2017)
    “… The aim of the beamformer is to minimise the total relays transmission power subject to the signal to interference and noise ratio (SINR…”
    Získať plný text
    Journal Article
  3. 3

    Power Control for Wireless Cellular Systems via D.C. Programming Autor Phan, Khoa T., Vorobyov, Sergiy A., Telambura, Chintha, Le-Ngoc, Tho

    ISBN: 9781424411979, 1424411971
    ISSN: 2373-0803
    Vydavateľské údaje: IEEE 01.08.2007
    “…Power control at the base station is typically used in wireless cellular networks in order to optimize the transmission subject to quality of service (QoS) constraints…”
    Získať plný text
    Konferenčný príspevok..
  4. 4

    Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach Autor Wei, Wei, Wang, Jianhui, Li, Na, Mei, Shengwei

    ISSN: 1949-3053, 1949-3061
    Vydavateľské údaje: Piscataway IEEE 01.11.2017
    Vydané v IEEE transactions on smart grid (01.11.2017)
    “…) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions…”
    Získať plný text
    Journal Article
  5. 5

    Robust network design in telecommunications under polytope demand uncertainty Autor Lemaréchal, Claude, Ouorou, Adam, Petrou, Georgios

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.11.2010
    “…We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the…”
    Získať plný text
    Journal Article
  6. 6

    Joint Sparse Beamforming and Power Control for a Large-Scale DAS With Network-Assisted Full Duplex Autor Xia, Xinjiang, Zhu, Pengcheng, Li, Jiamin, Wang, Dongming, Xin, Yuanxue, You, Xiaohu

    ISSN: 0018-9545, 1939-9359
    Vydavateľské údaje: New York IEEE 01.07.2020
    “… Two approaches have been proposed to solve the optimization problem, where the first approach converts the objective function to the difference of two convex functions with semi-definite relaxation…”
    Získať plný text
    Journal Article
  7. 7

    Cloud-based Queuing Model for Tactile Internet in Next Generation of RAN Autor Gholipoor, Narges, Parsaeefard, Saeedeh, Javan, Mohammad Reza, Mokari, Nader, Saeedi, Hamid, Pishro-Nik, Hossein

    ISSN: 2577-2465
    Vydavateľské údaje: IEEE 01.05.2020
    Vydané v IEEE Vehicular Technology Conference (01.05.2020)
    “…) queuing delays for each endto-end (E2E) connection between a pair of tactile users. In our setup, to minimize the transmit power of users subject to guaranteeing…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach Autor Zheng, Xiaojin, Sun, Xiaoling, Li, Duan, Sun, Jie

    ISSN: 0926-6003, 1573-2894
    Vydavateľské údaje: Boston Springer US 01.10.2014
    “… (difference of two convex functions) and a sequence of convex subproblems is then constructed by successively linearizing the concave terms of the DC function…”
    Získať plný text
    Journal Article
  9. 9

    Multi-objective optimization for information-energy transfer trade-offs in full-duplex multi-user MIMO cognitive networks Autor Nguyen, Xuan-Xinh, Kha, Ha Hoang, Thai, Pham Quang, Ta, Hung Quang

    ISSN: 1018-4864, 1572-9451
    Vydavateľské údaje: New York Springer US 01.01.2021
    Vydané v Telecommunication systems (01.01.2021)
    “… Hence, the design problem is modelled as a multi-objective optimization problem (MOOP) subject to the transmit power constraint at the base station and robust harmful interference constraints at the PUs…”
    Získať plný text
    Journal Article
  10. 10

    DC programming and DCA for enhancing physical layer security via relay beamforming strategies Autor Tran, Thi Thuy, Pham Thi, Hoai An, Pham Dinh, Tao, Nguyen, Nhu Tuan

    ISSN: 1862-4472, 1862-4480
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2021
    Vydané v Optimization letters (01.10.2021)
    “…: Amplify-and-Forward and Decode-and-Forward. The optimization problems with the aim of maximizing secrecy rate subject to total and individual…”
    Získať plný text
    Journal Article
  11. 11

    A Joint Communication and Federated Learning Framework for Internet of Things Networks Autor Yang, Zhaohui, Jia, Guangyu, Chen, Mingzhe, Lam, Hak-Keung, Wong, Kai-Kit, Cui, Shuguang, Poor, H. Vincent

    Vydavateľské údaje: IEEE 01.12.2021
    “…) signals are a type of data collected from wearable sensors of subjects which are distributed on multiple devices, highly personalized and play an important role in several applications including…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

    Uncoded placement optimization for coded delivery Autor Jin, Sian, Cui, Ying, Liu, Hui, Caire, Giuseppe

    Vydavateľské údaje: IFIP 01.05.2018
    “…Existing coded caching schemes fail to simultaneously achieve efficient content placement for non-uniform file popularity and efficient content delivery in the…”
    Získať plný text
    Konferenčný príspevok..
  13. 13

    Resource Management and Admission Control for Tactile Internet in Next Generation of RAN Autor Gholipoor, Narges, Parsaeefard, Saeedeh, Javan, Mohammad Reza, Mokari, Nader, Saeedi, Hamid, Pishro-Nik, Hossein

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 08.11.2019
    Vydané v arXiv.org (08.11.2019)
    “…) connection between each pair of tactile users. For this setup, with the aim to minimize the transmit power of users subject to guaranteeing tolerable delay of users, and fronthaul and access limitations, we formulate a resource allocation problem…”
    Získať plný text
    Paper
  14. 14

    Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints Autor Konno, Hiroshi, Wijayanayake, Annista

    ISSN: 0925-5001, 1573-2916
    Vydavateľské údaje: Dordrecht Springer Nature B.V 01.01.2002
    Vydané v Journal of global optimization (01.01.2002)
    “… (difference of two convex functions). We will propose a branch-and-bound algorithm for the resulting d.c…”
    Získať plný text
    Journal Article
  15. 15

    Verification of Markov Decision Processes with Risk-Sensitive Measures Autor Cubuktepe, Murat, Topcu, Ufuk

    ISSN: 2378-5861
    Vydavateľské údaje: AACC 01.06.2018
    “… We show that this nonlinear weighting function can be accurately approximated by the difference of two convex functions…”
    Získať plný text
    Konferenčný príspevok..
  16. 16

    Collaborative Beamforming for Cognitive UAV Relaying System Coexisting with Satellite Networks Autor Zhu, Shengxiang, Yang, Ke, Ouyang, Jian, Wu, Xiaohuan, Xie, Luyao

    ISSN: 2377-8512
    Vydavateľské údaje: IEEE 01.07.2019
    “… and the penalty function method as well as the difference of two-convex functions (D.C.) approach. Then a convergence proven iterative algorithm is designed to find the optimal CBF solution. Simulation results are provided to demonstrate the effectiveness of the proposed scheme and the impact of UAV transmit power and satellite network SINR requirements on the CURS…”
    Získať plný text
    Konferenčný príspevok..
  17. 17

    Verification of Markov Decision Processes with Risk-Sensitive Measures Autor Cubuktepe, Murat, Topcu, Ufuk

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.04.2020
    Vydané v arXiv.org (19.04.2020)
    “… We show that this nonlinear weighting function can be accurately approximated by the difference of two convex functions…”
    Získať plný text
    Paper
  18. 18

    Joint Sparse Beamforming and Power Control for Large-scale DAS with Network-Assisted Full Duplex Autor Xia, Xinjiang, Zhu, Pengcheng, Li, Jiamin, Wang, Dongming, Yuanxue Xin, You, Xiaohu

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 13.11.2019
    Vydané v arXiv.org (13.11.2019)
    “… To solve these problems, we aim to maximize the aggregated rate of uplink and downlink subject to quality of service constraints and backhaul constraints…”
    Získať plný text
    Paper
  19. 19

    Cloud-based Queuing Model for Tactile Internet in Next Generation of RAN Autor Gholipoor, Narges, Parsaeefard, Saeedeh, Javan, Mohammad Reza, Mokari, Nader, Saeedi, Hamid, Pishro-Nik, Hossein

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 08.11.2019
    Vydané v arXiv.org (08.11.2019)
    “…) queuing delays for each end-to-end (E2E) connection between a pair of tactile users. In our setup, to minimize the transmit power of users subject to guaranteeing…”
    Získať plný text
    Paper
  20. 20

    Optimized coordinated precoding in multicell MIMO wireless systems Autor Enlong Che, Tuan, H. D.

    Vydavateľské údaje: IEEE 01.09.2013
    “… (difference of two convex) functions. A simple but very efficient d.c. iterative algorithm (DCI) with guaranteed convergence is shown to locate the approximately optimal matrix solutions with the help of only a few converging semi-definite programs (SDP)…”
    Získať plný text
    Konferenčný príspevok..