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

DOI10.1109/TSP.2008.921762zbMath1390.94121OpenAlexW2096725988MaRDI QIDQ4569066

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

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)

Related Items (1)

Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation

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