On Low Complexity Robust Beamforming With Positive Semidefinite Constraints
From MaRDI portal
Publication:4570032
Recommendations
- Tightness of semidefinite programming relaxation to robust transmit beamforming with SINR constraints
- Large-Scale Robust Beamforming via $\ell _{\infty }$ -Minimization
- Response Vector Constrained Robust LCMV Beamforming Based on Semidefinite Programming
- Robust Adaptive Beamforming for General-Rank Signal Model With Positive Semi-Definite Constraint via POTDC
- Rank-Constrained Separable Semidefinite Programming With Applications to Optimal Beamforming
- Robust Beamforming by Linear Programming
- A Robust Adaptive Beamformer Based on Worst-Case Semi-Definite Programming
- On linearly constrained minimum variance beamforming
- On the Relationship Between Robust Minimum Variance Beamformers With Probabilistic and Worst-Case Distortionless Response Constraints
- Minimum sensitivity based robust beamforming with eigenspace decomposition
Cited in
(8)- Robust Capon beamformer under norm constraint
- Quadratic optimization problems in robust beamforming
- Response Vector Constrained Robust LCMV Beamforming Based on Semidefinite Programming
- L -infinity norm design of linear-phase robust broadband beamformers using constrained optimization
- Robust adaptive beamforming via improved worst-case performance optimization algorithm based on FDA-MIMO
- A Dual Perspective on Separable Semidefinite Programming With Applications to Optimal Downlink Beamforming
- scientific article; zbMATH DE number 7305731 (Why is no real title available?)
- Robust Beamforming by Linear Programming
This page was built for publication: On Low Complexity Robust Beamforming With Positive Semidefinite Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570032)
