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 43 for “"semidefinite relaxation"”.

  1. Determining the Distributed Karhunen-Loève Transform via Convex Semidefinite Relaxation

    The Karhunen–Loève Transform (KLT) is prevalent nowadays in communication and signal processing. This thesis aims at attaining the KLT in the encoders and achieving the minimum sum rate in the case of Gaussian multiterminal source coding. In the general multiterminal source coding case, the data …

    mcmaster Repository record for Determining the Distributed Karhunen-Loève Transform via Convex Semidefinite Relaxation (opens in a new tab)

  2. Semidefinite Relaxation-Based Soft MIMO Demodulation via Efficient Dual Scaling

    … soft MIMO demodulator that is based on semidefinite relaxation (SDR) and uses the max-log approximation to reduce the cost of the demodulation. In particular, we develop a customized dual-scaling algorithm to solve the semidefinite program that constitutes the core computational task of …

    mcmaster Repository record for Semidefinite Relaxation-Based Soft MIMO Demodulation via Efficient Dual Scaling (opens in a new tab)

  3. Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems

    … of large-scale minimum bisection problems via a semidefinite relaxation in a branch-and-cut framework. After reviewing known results on the underlying bisection cut polytope a study of new facet-defining inequalities is presented. They are derived from the known knapsack tree inequalities. We …

    qucosa-diss

  4. Perfect Recovery in Heterogeneous Stochastic Bicluster Models

    … with high probability by solving a particular semidefinite relaxation, provided the input graph is drawn from a heterogeneous planted–bicluster model. We proceed to derive necessary and sufficient conditions for exact recovery, then via numerical simulations, we explore the impact of sparsity, …

    alabama Repository record for Perfect Recovery in Heterogeneous Stochastic Bicluster Models (opens in a new tab)

  5. Linear and nonlinear semidefinite relaxations of some NP-hard problems

    Semidefinite relaxation (SDR) is a powerful tool to estimate bounds and obtain approximate solutions for NP-hard problems. This thesis introduces and studies several novel linear and nonlinear semidefinite relaxation models for some NP-hard problems. We first study the semidefinite relaxation of …

    uiuc Repository record for Linear and nonlinear semidefinite relaxations of some NP-hard problems (opens in a new tab)

  6. On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming

    … time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian Relaxation and the semidefinite relaxation. Then we focus on two special classes …

    waterloo Repository record for On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming (opens in a new tab)

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

    … an algorithm for each design problem through semidefinite relaxation. Our analysis shows that, even though the beamforming scheme in our designs is fixed as single stream beamforming, this does not cause any loss of optimality. We further consider secure transmission designs for a simultaneous …

    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)

  8. Convex relaxation based locational marginal prices for electricity markets

    We propose and analyze semidefinite relaxation-based locational marginal prices (RLMPs) for real and reactive power in electricity markets. Our analysis reveals that when the nonconvex economic dispatch problem has zero duality gap, the RLMPs exhibit properties similar to locational marginal prices …

    uiuc Repository record for Convex relaxation based locational marginal prices for electricity markets (opens in a new tab)

  9. Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion

    … of this thesis is the development of a theory of semidefinite facial reduction for the Euclidean distance matrix completion problem. Our key result shows a close connection between cliques in the graph of the partial Euclidean distance matrix and faces of the semidefinite cone containing the …

    waterloo Repository record for Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion (opens in a new tab)

  10. Joint beamforming, channel and power allocation in multi-user and multi-channel underlay MISO cognitive radio networks

    … an introduced optimal auxiliary variable and semidefinite relaxation (SDR) approach. Next, two explicit searching algorithms, i.e., genetic algorithm (GA) and simulated annealing (SA)-based algorithm are proposed to determine optimal channel allocations. Simulation results show that …

    manitoba Repository record for Joint beamforming, channel and power allocation in multi-user and multi-channel underlay MISO cognitive radio networks (opens in a new tab)

  11. Soft Demodulation Schemes for MIMO Communication Systems

    … based on insight generated from the analysis of semidefinite relaxation techniques for hard demodulation. The proposed tree-search demodulators are based on a multi-stack algorithm, developed herein, for efficiently traversing the tree structure that is inherent in the MIMO demodulation problem. …

    mcmaster Repository record for Soft Demodulation Schemes for MIMO Communication Systems (opens in a new tab)

  12. Semidefinite Relaxations for Geometric Problems in Robotics

    … We begin with a summary and extension of the semidefinite relaxation machinery that we apply to both problems. This machinery is used to develop fast and accurate extrinsic calibration algorithms with novel performance guarantees provided by certificates of global optimality. We proceed to …

    toronto-retro Repository record for Semidefinite Relaxations for Geometric Problems in Robotics (opens in a new tab)

  13. Mixed Integer Nonlinear Programs: Theory, Algorithms and Applications

    … Demonstrating the technique, we derive a semidefinite relaxation for fractional programs. In the process, we introduce the concept of convex extensions, study its convexification properties, and apply it to develop tight relaxations for hyperbolic programs and pooling/blending problems. …

    uiuc Repository record for Mixed Integer Nonlinear Programs: Theory, Algorithms and Applications (opens in a new tab)

  14. Quantication of the Impact of Uncertainty in Power Systems using Convex Optimization

    … minimum bounds are then estimated from either Semidefinite relaxation of Quadratically-Constrained Quadratic-Programming or Alternating Direction Method of Multipliers. For the second topic, an analytical method to quantify power systems stability margins while acknowleding uncertainty is …

    umn Repository record for Quantication of the Impact of Uncertainty in Power Systems using Convex Optimization (opens in a new tab)

  15. REACHING A TARGET WITHIN A GPS-DENIED OR COSTLY AREA: A TWO-STAGE OPTIMAL CONTROL APPROACH

    … methods for a QC2QP utilizing its dual and semidefinite relaxation. For the GPS-denied area, we formulate another two-stage optimal control problem where perturbation is considered. To deal with the perturbation, we propose a robust controller using the variable horizon model predictive …

    maryland Repository record for REACHING A TARGET WITHIN A GPS-DENIED OR COSTLY AREA: A TWO-STAGE OPTIMAL CONTROL APPROACH (opens in a new tab)

  16. A two-timescale approach for network slicing in C-RAN.

    … linear matrix inequalities. We further apply semidefinite relaxation to transform the problem into a mixed integer nonconvex optimization problem, which can be solved by combining branch-and-bound and primal-relaxed dual techniques. Simulation results show that our proposed scheme can well …

    ubc Repository record for A two-timescale approach for network slicing in C-RAN. (opens in a new tab) Download PDF for A two-timescale approach for network slicing in C-RAN. (opens in a new tab)

  17. Sparsity-cognizant algorithms with applications to communications, signal processing, and the smart grid.

    … to nonlinear measurements is handled using the semidefinite relaxation technique. Different from existing iterative methods, the proposed algorithm approximates well the global optimum regardless of the initialization. In addition, for enhanced situational awareness, a novel sparse overcomplete …

    umn Repository record for Sparsity-cognizant algorithms with applications to communications, signal processing, and the smart grid. (opens in a new tab)

  18. MULTICELL ROBUST DOWNLINK BEAMFORMING

    … a distributed optimization problem in a standard semidefinite relaxation (SDR) is introduced that minimizes a combination of the sum-power, used by each base station (BS) to transmit data to its local users, and the worst-case of the resulting overall interference induced on the other users of the …

    kings Repository record for MULTICELL ROBUST DOWNLINK BEAMFORMING (opens in a new tab) Download PDF for MULTICELL ROBUST DOWNLINK BEAMFORMING (opens in a new tab)

  19. Transmit Beamforming for Multi-User Integrated Sensing and Communication Systems

    … the dimensionality of the solution space via semidefinite relaxation. Further, they are limited to static sensing scenarios, making them unsuitable for dynamic environments. The first part of this thesis aims to reduce the computational burden by characterizing the minimum number of …

    toronto-retro Repository record for Transmit Beamforming for Multi-User Integrated Sensing and Communication Systems (opens in a new tab)

  20. Enhancing Energy and Spectral Efficiencies in Wireless Cellular Networks

    … in a form that is amenable to the standard semidefinite relaxation (SDR) with Gaussian randomization approach. This approach has a polynomial-time complexity, and yields a close-to-optimal performance.The thesis later shifts the focus to enhancing spectral efficiency in multi-tier …

    carleton Repository record for Enhancing Energy and Spectral Efficiencies in Wireless Cellular Networks (opens in a new tab)

Page 1 of 3