Improved approximation bound for quadratic optimization problems with orthogonality constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Journal of Global Optimization
IEEE Transactions on Signal Processing
Multiple peer-to-peer communications using a network of relays
IEEE Transactions on Signal Processing
Spectrum sharing in wireless networks via QoS-aware secondary multicast beamforming
IEEE Transactions on Signal Processing
On multicast beamforming for minimum outage
IEEE Transactions on Wireless Communications
On optimal precoding in linear vector Gaussian channels with arbitrary input distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Efficient implementation of quasi-maximum-likelihood detection based on semidefinite relaxation
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
Journal of Global Optimization
Beamforming-based physical layer network coding for non-regenerative multi-way relaying
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
SIAM Journal on Optimization
SIAM Journal on Optimization
Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
SIAM Journal on Optimization
Improved design of unimodular waveforms for MIMO radar
Multidimensional Systems and Signal Processing
Hi-index | 0.02 |
We consider the NP-hard problem of finding a minimum norm vector in $n$-dimensional real or complex Euclidean space, subject to $m$ concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an $O(m^2)$ approximation in the real case and an $O(m)$ approximation in the complex case. Moreover, we show that these bounds are tight up to a constant factor. When the Hessian of each constraint function is of rank $1$ (namely, outer products of some given so-called steering vectors) and the phase spread of the entries of these steering vectors are bounded away from $\pi/2$, we establish a certain “constant factor” approximation (depending on the phase spread but independent of $m$ and $n$) for both the SDP relaxation and a convex QP restriction of the original NP-hard problem. Finally, we consider a related problem of finding a maximum norm vector subject to $m$ convex homogeneous quadratic constraints. We show that an SDP relaxation for this nonconvex QP provides an $O(1/\ln(m))$ approximation, which is analogous to a result of Nemirovski &etal; [Math. Program., 86 (1999), pp. 463-473] for the real case.