Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 28 for “"Successive convex approximation"”.

  1. Successive convex approximation: analysis and applications

    … approach which updates the variable blocks by successively minimizing a sequence of approximations of f which are either locally tight upper bounds of f or strictly convex local approximations of f. Different block selection rules are considered such as cyclic (Gauss-Seidel), greedy …

    umn Repository record for Successive convex approximation: analysis and applications (opens in a new tab)

  2. Joint resource allocation and routing in wireless networks via convex approximation techniques

    … developments in the DSL literature, we use successive convex approximation strategies to approximate it, and come up with efficient centralized algorithms that provide approximate solutions to the BPPC problem. Our extensive simulation results prove that our proposed solutions deliver …

    greece Repository record for Joint resource allocation and routing in wireless networks via convex approximation techniques (opens in a new tab)

  3. Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications

    … in polynomial-time. Such cases are said to be convex in a hidden way, and the task of identifying them remains an active area of research. Meanwhile, relatively few methods are known to be effective for general QCQP problems. The prevailing approach of Semidefinite Relaxation (SDR) is …

    umn Repository record for Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications (opens in a new tab)

  4. Fast algorithm for joint unicast and multicast beamforming in large-scale systems

    … For the multicast subproblem, we apply the successive convex approximation (SCA) method to solve it iteratively. Each SCA subproblem is then reformulated to the ADMM form, providing the closed-form update for the multicast subproblem. Simulation results show that the proposed algorithm …

    uoit Repository record for Fast algorithm for joint unicast and multicast beamforming in large-scale systems (opens in a new tab)

  5. Optimal structure and efficient algorithm for max-min fair multi-group multicast beamforming

    … two algorithms by either direct method via successive convex approximation (SCA), or solving the QoS problem iteratively. For massive MIMO systems, we propose an efficient MMF multicast beamforming design based on the optimal solution structure. The semi-definite relaxation (SDR) method and …

    uoit Repository record for Optimal structure and efficient algorithm for max-min fair multi-group multicast beamforming (opens in a new tab)

  6. Energy efficiency maximization for NOMA backscatter systems

    … of the reader. The formulated problem is nonconvex. To obtain a suboptimal solution for this problem, we use alternating optimization technique and decompose the problem into two subproblems. The subproblems are solved by using fractional programming, Dinkelbach’s algorithm, and successive …

    ubc Repository record for Energy efficiency maximization for NOMA backscatter systems (opens in a new tab) Download PDF for Energy efficiency maximization for NOMA backscatter systems (opens in a new tab)

  7. Harnessing Reconfigurable Intelligent Surfaces For Next-Gen Wireless Networks: Enhancing Efficiency, Reliability, and Security

    … Output (MISO) configuration. To tackle the non-convex optimization problem, an alternating optimization framework based on successive convex approximation (SCA) is developed, achieving up to a 20.3% improvement in network sum rate. Additionally, to simplify real-time decision-making, a deep …

    concordia Download PDF for Harnessing Reconfigurable Intelligent Surfaces For Next-Gen Wireless Networks: Enhancing Efficiency, Reliability, and Security (opens in a new tab)

  8. Low complexity multicast beamforming in massive MIMO multi-cell networks

    … solve it via semi-definite relaxation (SDR) and successive convex approximation (SCA). To further reduce the computational complexity and the communication overhead, a distributed weighted MRT beamforming design based on signal-to-leakage ratio (SLR) is developed. Furthermore, we propose a …

    uoit Repository record for Low complexity multicast beamforming in massive MIMO multi-cell networks (opens in a new tab)

  9. MULTIPLE-TIME-SLOT COMMUNICATION RESOURCE ALLOCATION FOR MULTIPLE ACCESS COMPUTATION OFFLOADING

    … access can be formulated as reduced-dimension convex optimizations. For NOMA with ID or FOSD, we show that the resource allocation problem has a difference-of-convex structure and we develop a successive convex approximation (SCA) algorithm with feasible point pursuit. Furthermore, for the FOSD …

    mcmaster Repository record for MULTIPLE-TIME-SLOT COMMUNICATION RESOURCE ALLOCATION FOR MULTIPLE ACCESS COMPUTATION OFFLOADING (opens in a new tab)

  10. Sum-rate maximization in multi-RIS multi-carrier systems through active power allocation and passive beamforming

    … power allocation and passive RIS beamforming. Approximations are introduced in the algorithm design to enable tractable, suboptimal solutions for the passive array optimization under each scenario. To validate our approach, we benchmark the proposed methods against an exhaustive search …

    uoit Repository record for Sum-rate maximization in multi-RIS multi-carrier systems through active power allocation and passive beamforming (opens in a new tab)

  11. Physical layer security for jamming signal aided multi-antenna communication systems

    … we propose a semidefinite relaxation and successive convex approximation based centralized secure transmission design algorithm. Moreover, an alternating direction method of multipliers based distributed secure transmission design is also proposed. Simulation results demonstrate the …

    ubc Repository record for Physical layer security for jamming signal aided multi-antenna communication systems (opens in a new tab) Download PDF for Physical layer security for jamming signal aided multi-antenna communication systems (opens in a new tab)

  12. Fronthaul-constrained Uplink Cloud Radio-access Networks: Capacity Analysis and Algorithm Design

    … message codewords simultaneously, or generalized successive decoding of quantization and message codewords in an arbitrary order. Under this setup, this thesis establishes several information theoretic results and proposes a number of practical algorithm designs. From a theoretical perspective, …

    toronto-retro Repository record for Fronthaul-constrained Uplink Cloud Radio-access Networks: Capacity Analysis and Algorithm Design (opens in a new tab)

  13. Optimization and Learning Methods for Electric Distribution Network Management

    … regulation. The AC OPF problem is known to be nonconvex (and, in fact, NP-hard). Convex relaxation techniques have been recently explored to solve the OPF task with reduced computational burden; however, sufficient conditions for tightness of these relaxations are only available for restricted …

    umn Repository record for Optimization and Learning Methods for Electric Distribution Network Management (opens in a new tab)

  14. Network Slicing and Resource Allocation in Cloud Radio Access Networks

    … as a sum-rate maximization problem, and a successive convex approximation-based algorithm is proposed to solve it. In the third problem, we study RAN slicing in C-RAN with Multi-access Edge Computing capability, where computation-intensive tasks are offloaded to edge servers. A machine …

    calgary Repository record for Network Slicing and Resource Allocation in Cloud Radio Access Networks (opens in a new tab)

  15. Robust and Efficient Algorithms for Millimeter-Wave Radar Localization and Imaging

    … design. The resulting robust SAS problem is a nonconvex optimization problem with quadratic constraints. We devise an algorithm based on feasible point pursuit and successive convex approximation to solve the optimization problem. Third, due to the unforeseen disturbance and imperfect measurement, …

    mcmaster Repository record for Robust and Efficient Algorithms for Millimeter-Wave Radar Localization and Imaging (opens in a new tab)

  16. Resource and Interference Management in UAV-Cellular Network

    … to solve it efficiently. We first use convex optimization and the Hungarian algorithm to obtain the global optimal of power and subchannel allocations in the licensed spectrum, respectively. Then, we design a matching game with externalities and coalition game algorithms to obtain the …

    waterloo Repository record for Resource and Interference Management in UAV-Cellular Network (opens in a new tab)

  17. Dynamic optimization and monitoring in communication networks

    … use in Aloha-based MAC, and the resulting non-convex problem is solved via successive convex approximation to realize practical network coding algorithms. Benefits of network coding also extend to QoS-constrained scenarios, such as in real-time and streaming media applications. Modeling …

    umn Repository record for Dynamic optimization and monitoring in communication networks (opens in a new tab)

  18. Simulation, optimisation, and control of multirate dynamics

    … and often results in an intractible nonconvex problem. Therefore, we formulate a novel linearisation strategy for variational models and implement the multirate variational approach within a tube-based nonlinear receding horizon (RH) strategy. This results in a successive convex …

    oxford Repository record for Simulation, optimisation, and control of multirate dynamics (opens in a new tab)

  19. Development and Performance Analysis of Integrated Sensing and Communication Systems in Outdoor and Indoor Scenarios

    … improvement. To improve the energy efficiency, successive convex approximation (SCA)-based and projected gradient descent (PGD)-based power allocation schemes are developed. At a DL/UL ratio of 8:2, the two schemes reduce power consumption by approximately 17\% and 45\%, respectively, while the …

    kent Download PDF for Development and Performance Analysis of Integrated Sensing and Communication Systems in Outdoor and Indoor Scenarios (opens in a new tab)

  20. Advanced mathematical optimization methods in communication networks assisted by Reconfigurable Intelligent Surfaces

    … models, a series of high-dimensional and non-convex optimization problems are formulated to maximize key performance metrics, including spectral efficiency, computation efficiency, energy efficiency, fairness, and secrecy performance. To address their inherent complexity, the thesis develops …

    greece Repository record for Advanced mathematical optimization methods in communication networks assisted by Reconfigurable Intelligent Surfaces (opens in a new tab)

Page 1 of 2