Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem

DOI10.1109/TSP.2008.921762MaRDI QIDQ4569066zbMATH OpenOpenAlexFDO

Authors Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi

Publication date 27 June 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2008.921762

Mathematics Subject Classification ID

Quadratic programming (90C20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(4)

• Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
• Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation
• Exact lower bound for proportion of maximally embedded beamlet
• A Dual Perspective on Separable Semidefinite Programming With Applications to Optimal Downlink Beamforming

This page was built for publication: Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569066)