Probabilistic analysis of semidefinite relaxation for binary quadratic minimization

SIAM Journal on Optimization

Volumn 20, Issue 4, 2010, Pages 1906-1922

  Kisialiou, Mikalai ^a   Luo, Zhi Quan ^a  

^a University of Minnesota   (United States)

Author keywords

Binary quadratic minimization; Probabilistic performance analysis; Random matrix theory; Semidefinite relaxation

Indexed keywords

APPROXIMATION RATIOS; CONSTANT FACTOR APPROXIMATION; CONSTANT FACTORS; DIGITAL COMMUNICATIONS; DISCRETE SIGNAL; KARUSH KUHN TUCKERS; MAXIMUM- LIKELIHOOD DETECTION; NEAR-OPTIMAL SOLUTIONS; NP-HARD PROBLEM; OPTIMALITY CONDITIONS; POLYNOMIAL-TIME; PROBABILISTIC ANALYSIS; PROBABILISTIC PERFORMANCE; PROBLEM SIZE; QUADRATIC MINIMIZATION; RANDOM MATRIX THEORY; SEMIDEFINITE PROGRAMMING RELAXATIONS; SEMIDEFINITE RELAXATION;

COMPUTATIONAL COMPLEXITY; DIGITAL COMMUNICATION SYSTEMS; INFORMATION RETRIEVAL; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; POLYNOMIAL APPROXIMATION;

ASYMPTOTIC ANALYSIS;

EID: 77951279519     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/08072320X     Document Type: Article

References (28)

1. M.O. Damen, H. El Gamal, and G. Caire, On maximum-likelihood detection and the search for the closest lattice point, IEEE Trans. Inform. Theory, 49 (2003), pp. 2389-2402.
2. A. Edelman, Eigenvalues and Condition Numbers of Random Matrices, Ph.D. Thesis, Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, 1989.
3. U. Fincke and M. Pohst, Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, Math. Comp., 44 (1985), pp. 463-471.
4. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problem using semi-definite programming, J. ACM, 42 (1995), pp. 1115-1145.
5. G.B. Giannakis, Z. Liu, X. Ma, and S. Zhou, Space-time Coding for Broadband Wireless Communications, Wiley-Interscience, New York, 2003.
6. D. Guo and S. Verdu, Randomly spread CDMA: Asymptotics via statistical physics, IEEE Trans. Inform. Theory, 51 (2005), pp. 1983-2010. (Pubitemid 40843621)
7. J. Jalden, Detection for Multiple Input Multiple Output Channels, Ph.D. Thesis, School of Electrical Engineering, KTH, Stockholm, Sweden, 2006.
8. J. Jalden, C. Martin, and B. Ottersten, Semidefinite programming fordetection in linear systems-Optimality conditions and space-time decoding, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'03), Hong Kong, 2003, Vol.3, pp. 9-12.
9. J. Jalden and B. Ottersten, An exponential lower bound on the expected complexity of sphere decoding, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'04), Montreal, 2004, Vol.4, pp. 393-396.
10. M. Kisialiou and Z.-Q. Luo, Performance analysis of quasi-maximum- likelihood detector based on semi-definite programming, in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'05), Philadelphia, 2005, Vol.5, pp. 433-436.
11. M. Kisialiou and Z.-Q. Luo, Efficient implementation of quasi-maximum-likelihood detection based on semidefinite relaxation, IEEE Trans. Signal Process., to appear.
12. Z.-Q. Luo, N.D. Sidiropoulos, P. Tseng, and S. Zhang, Approximation bounds for quadratic optimization with homogeneous quadratic constraints, SIAM J. Optim., 18 (2007), pp. 1- 28.
13. W.K. Ma, P.C. Ching, and Z. Ding, Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems, IEEE Trans. Signal Process., 52 (2004), pp. 2862-2872.
14. W.K. Ma, T.N. Davidson, K.M. Wong, Z.-Q. Luo, and P.C. Ching, Quasi-maximumlikelihood multiuser detection using semi-definite relaxation, IEEE Trans. Signal Process., 50 (2002), pp. 912-922.
15. V.A. Marcenko and L.A. Pastur, Distribution of eigenvalues for some sets of random matrices, Math. USSR, Sb. 1 (1967), pp. 457-483.
16. A. Mobasher and A.K. Khandani, Matrix-lifting semi-definite programming for decoding in multiple antenna systems, in Proceedings of the 10th Canadian Workshop on Information Theory (CWIT'07), Edmonton, AB, 2007, IEEE Press, Piscataway, NJ, pp. 136-139. (Pubitemid 47469371)
17. A. Mobasher, M. Taherzadeh, R. Sotirov, and A.K. Khandani, A near-maximumlikelihood decoding algorithm for MIMO systems based on semi-definite programming, IEEE Trans. Inform. Theory, 53 (2007), pp. 3869-3886. (Pubitemid 350141892)
18. Y.E. Nesterov, Quality of Semidefinite Relaxation for Nonconvex Quadratic Optimization, CORE Discussion Paper 9719, UCL, Louvain-la-Neuve, Belgium, 1997.
19. J. Proakis, Digital Communications, 4th ed., McGraw-Hill Science, New York, 2000.
20. N.D. Sidiropoulos and Z.-Q. Luo, A semidefinite relaxation approach to MIMO detection for higher-order QAM constellations, IEEE Signal Process. Letters, 13 (2006), pp. 525-528.
21. J.W. Silverstein, The smallest eigenvalue of a large-dimensional Wishart matrix, Ann. Probab., 13 (1985), pp. 1364-1368.
22. J.W. Silverstein and Z.D. Bai, On the empirical distribution of eigenvalues of a class of large dimensional random matrices, J. Multivariate Anal., 54 (1995), pp. 175-192.
23. T. Tanaka, A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors, IEEE Trans. Inform. Theory, 48 (2002), pp. 2888-2910.
24. D.N.C. Tse and S.V. Hanly, Linear multiuser receivers: Effective interference, effective bandwidth and user capacity, IEEE Trans. Inform. Theory, 45 (1999), pp. 641-657.
25. A.M. Tulino and S. Verdù, Random Matrix Theory and Wireless Communications, Found. Trends Comm. Inform. Theory 1, NOW Publishers, Delft, The Netherlands, 2004.
26. S. Verdù, Multiuser Detection, Cambridge University Press, Cambridge, UK, 1998.
27. E. Viterbo and J. Bouros, A universal lattice code decoder for fading channels, IEEE Trans. Inform. Theory, 45 (1999), pp. 1639-1642.
28. A. Wiesel, Y. Eldar, and S. Shamai, Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels, IEEE Signal Process. Letters, 12 (2005), pp. 653-656.