Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints
From MaRDI portal
Publication:460032
zbMATH Open1296.90087MaRDI QIDQ460032FDOQ460032
Authors: Yanjun Wang, Ruizhi Shi 
Publication date: 13 October 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Recommendations
- SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Robust linear MIMO in the downlink: A worst-case optimization with ellipsoidal uncertainty regions
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Semidefinite and conic programming for robust wireless OFDMA networks
Cited In (8)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Response Vector Constrained Robust LCMV Beamforming Based on Semidefinite Programming
- SINR Constrained Beamforming for a<?Pub _newline ?>MIMO Multi-User Downlink System: Algorithms and Convergence Analysis
- A Dual Perspective on Separable Semidefinite Programming With Applications to Optimal Downlink Beamforming
- Title not available (Why is that?)
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- Comparison of \(\ell _{\infty }\)-norm and \(\ell _1\)-norm optimization criteria for SIR-balanced multi-user beamforming
- On Low Complexity Robust Beamforming With Positive Semidefinite Constraints
This page was built for publication: Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460032)
