Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming

DOI10.1109/TSP.2009.2031732MaRDI QIDQ4570119zbMATH OpenOpenAlexFDO

Authors Yong-Wei Huang, D. P. Palomar

Publication date 9 July 2018

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

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(9)

• Beamforming optimization for information enhancement transmission in MISO SWIPT with NOMA system
• Computation of the phase and gain margins of MIMO control systems
• On Low Complexity Robust Beamforming With Positive Semidefinite Constraints
• A Dual Perspective on Separable Semidefinite Programming With Applications to Optimal Downlink Beamforming
• Response Vector Constrained Robust LCMV Beamforming Based on Semidefinite Programming
• Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment
• scientific article; zbMATH DE number 7305731 (Why is no real title available?)
• Optimal beamforming via interior point methods
• A semidefinite relaxation for sums of heterogeneous quadratic forms on the Stiefel manifold

This page was built for publication: Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming

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