Semidefinite relaxation of quadratic optimization problems

IEEE Signal Processing Magazine

Volumn 27, Issue 3, 2010, Pages 20-34

  Luo, Zhi Quan ^a   Ma, Wing Kin ^b   So, Anthony ^b   Ye, Yinyu ^c   Zhang, Shuzhong ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; QUADRATIC PROGRAMMING;

APPROXIMATION TECHNIQUES; COMPUTATIONALLY EFFICIENT; FOLLOWING PROBLEM; NONCONVEX; OPTIMIZATION PROBLEMS; QUADRATIC OPTIMIZATION PROBLEMS; QUADRATICALLY-CONSTRAINED QUADRATIC PROGRAMS; SEMIDEFINITE RELAXATION;

SIGNAL PROCESSING;

EID: 85032752455     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2010.936019     Document Type: Conference Paper

References (80)

1. A. B. Gershman, N. D. Sidiropoulos, S. Shahbazpanahi, M. Bengtsson, and B. Ottersten, "Convex optimization-based beamforming," IEEE Signal Process ing Mag., vol.27, no.3, pp. 62-75, 2010.
2. L. Lovász, "On the Shannon capacity of a graph," IEEE Trans. Inform. Theory, vol.IT-25, no.1, pp. 1-7, 1979.
3. M. X. Goemans and D. P. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problem using semi-definite programming," J. ACM, vol.42, no.6, pp. 1115-1145, 1995.
4. Yu. E. Nesterov, "Semidefinite relaxation and nonconvex quadratic optimization," Optim. Methods Softw., vol.9, no.1-3, pp. 141-160, 1998.
5. Y. Ye, "Approximating quadratic programming with bound and quadratic constraints," Math. Program., vol.84, no.2, pp. 219-226, 1999.
6. A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Math. Program., vol.86, no.3, pp. 463-473, 1999.
7. S. Zhang, "Quadratic maximization and semidefinite relaxation," Math. Program., vol.87, no.3, pp. 453-465, 2000.
8. S. Zhang and Y. Huang, "Complex quadratic optimization and semidefinite programming," SIAM J. Optim., vol.16, no.3, pp. 871-890, 2006.
9. A. M.-C. So, J. Zhang, and Y. Ye, "On approximating complex quadratic optimization problems via semidefinite programming relaxations," Math. Program., vol.110, no.1, pp. 93-110, 2007.
10. Z.-Q. Luo, N. D. Sidiropoulos, P. Tseng, and S. Zhang, "Approximation bounds for quadratic optimization with homogeneous quadratic constraints," SIAM J. Optim., vol.18, no.1, pp. 1-28, Feb. 2007.
11. S. He, Z.-Q. Luo, J. Nie, and S. Zhang, "Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization," SIAM J. Optim., vol.19, no.2, pp. 503-523, 2008.
12. Y. Ye and S. Zhang, "New results on quadratic minimization," SIAM J. Op-tim., vol.14, no.1, pp. 245-267, 2003.
13. A. Beck and Y. C. Eldar, "Strong duality in nonconvex quadratic optimization with two quadratic constraints," SIAM J. Optim., vol.17, no.3, pp. 844-860, 2003.
14. Y. Huang and S. Zhang, "Complex matrix decomposition and quadratic programming," Math. Oper. Res., vol.32, no.3, pp. 758-768, Aug. 2007.
15. E. Karipidis, N. D. Sidiropoulos, and Z.-Q. Luo, "Far-field multicast beam-forming for uniform linear antenna arrays," IEEE Trans. Signal Processing, vol.55, no.10, pp. 4916-4927, 2007.
16. Y. Huang and D. P. Palomar, "Rank-constrained separable semidefinite programming with applications to optimal beamforming," IEEE Trans. Signal Processing, vol.58, no.2, pp 664-678, Feb. 2010.
17. P. Tan and L. Rasmussen, "The application of semidefinite programming for detection in CDMA," IEEE J. Select. Areas Commun., vol.19, no.8, pp. 1442-1449, Aug. 2001. (Pubitemid 32866225)
18. W.-K. Ma, T. N. Davidson, K. M. Wong, Z.-Q. Luo, and P. C. Ching, "Quasi-maximum-likelihood multiuser detection using semi-definite relaxation with application to synchronous CDMA," IEEE Trans. Signal Processing, vol.50, no.4, pp. 912-922, Apr. 2002.
19. B. Steingrimsson, Z.-Q. Luo, and K. M. Wong, "Soft quasi-maximum-likelihood detection for multiple-antenna wireless channels," IEEE Trans. Signal Processing, vol.51, no.11, pp. 2710-2719, 2003.
20. W.-K. Ma, P. C. Ching, and Z. Ding, "Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems," IEEE Trans. Signal Processing, vol.52, no.10, pp. 2862-2872, 2004.
21. M. Kisialiou, X. Luo, and Z.-Q. Luo, "Efficient implementation of quasi-maximum-likelihood detection based on semidefinite relaxation," IEEE Trans. Signal Processing, vol.57, no.12, pp. 4811-4822, Dec. 2009.
22. A. Mobasher, M. Taherzadeh, R. Sotirov, and A. K. Khandani, "A near-maximum-likelihood decoding algorithm for MIMO systems based on semi-definite programming," IEEE Trans. Inform. Theory, vol.53, no.11, pp. 3869-3886, 2007. (Pubitemid 350141892)
23. W.-K. Ma, C.-C. Su, J. Jaldén, T.-H. Chang, and C.-Y. Chi, "The equivalence of semidefinite relaxation MIMO detectors for higher-order QAM," IEEE J. Select. Topics Signal Processing, vol.3, no.6, pp. 1038-1052, Dec. 2009.
24. Q. Li, E.-W. Bai, and Y. Ye, "Blind channel equalization and P-approximation algorithms," IEEE Trans. Signal Processing, vol.49, no.1, pp. 2823-2831, Nov. 2001.
25. Q. Li, E.-W. Bai, and Z. Ding, "Blind source separation of signals with known alphabets using P-approximation algorithms," IEEE Trans. Signal Processing, vol.51, no.1, pp. 1-10, Jan. 2003.
26. W.-K. Ma, B.-N. Vo, T. N. Davidson, and P. C. Ching, "Blind ML detection of orthogonal space-time block codes: Efficient high-performance implementations," IEEE Trans. Signal Processing, vol.54, no.2, pp. 738-751, Feb. 2006.
27. Z.-Q. Luo and T.-H. Chang, "SDP relaxation of homogeneous quadratic optimization: Approximation bounds and applications," in Convex Optimization in Signal Processing and Communications, D. P. Palomar and Y. C. Eldar, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2010, ch. 4.
28. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, "Semidefinite programming based algorithms for sensor network localization," ACM Trans. Sensor Networks, vol.2, no.2, pp. 188-220, 2006.
29. P. Biswas, T.-C. Liang, K.-C. Toh, Y. Ye, and T.-C. Wang, "Semidefinite programming approaches for sensor network localization with noisy distance measurements," IEEE Trans. Automat. Sci. Eng., vol.3, no.4, pp. 360-371, Oct. 2006.
30. A. M.-C. So and Y. Ye, "Theory of semidefinite programming for sensor network localization," Math. Program., Series B, vol.109, no.2-3, pp. 367-384, 2007.
31. K. W. K. Lui, W.-K. Ma, H. C. So, and F. K. W. Chan, "Semi-definite programming algorithms for sensor network node localization with uncertainties in anchor positions and/or propagation speed," IEEE Trans. Signal Processing, vol.57, no.2, pp. 752-763, 2009.
32. A. De Maio, S. De Nicola, Y. Huang, S. Zhang, and A. Farina, "Code design to optimize radar detection performance under accuracy and similarity constraints," IEEE Trans. Signal Processing, vol.56, no.11, pp. 5618-5629, Nov. 2008.
33. A. De Maio, S. De Nicola, Y. Huang, Z.-Q. Luo, and S. Zhang, "Design of phase codes for radar performance optimization with a similarity constraint," IEEE Trans. Signal Processing, vol.57, no.2, pp. 610-621, Feb. 2009.
34. J.-J. Xiao, Z.-Q. Luo, and M. Jiang, "Two-dimensional phase unwrapping using semidefinite relaxation," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Taipei, Taiwan, Apr. 2009, pp. 1105-1108.
35. W.-K. Ma, P.-C. Ching, and B.-N. Vo, "Crosstalk resilient interference cancellation in microphone arrays using capon beamforming," IEEE Trans. Speech Audio Processing, vol.12, no.5, pp. 468-477, Sept. 2004.
36. H. Jiang and X. Li, "Applications of convex optimization," IEEE Signal Processing Mag., vol.27, no.3, pp. 115-127, 2010.
37. T.-H. Chang, Z.-Q. Luo, X. Wu, C. Akgun, J. Vaughan, K. Ugurbil, and P.-F. V. de Moortele, "Transmit B1 shimming at high field with SAR constraints: A two stage optimization independent of the initial set of RF phases and amplitudes," in Proc. 16th Int. Society for Magnetic Resonance in Medicine, Toronto, ON, Canada, May 3-9, 2008.
38. K. W. Cheung, W.-K. Ma, and H. C. So, "Accurate approximation algorithm for TOA-based maximum likelihood mobile location using semidefinite programming," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Montreal, Canada, May 2004, pp. 145-148.
39. K.-H. Yang, G. Wang, and Z.-Q. Luo, "Efficient convex relaxation methods for robust target localization by a sensor network using time differences of arrivals," IEEE Trans. Signal Processing, vol.57, no.7, pp. 2775-2784, 2009.
40. R. Zhang, Y.-C. Liang, C.-C. Chai, and S. Cui, "Optimal beamforming for two-way multi-antenna relay channel with analogue network coding," IEEE J. Select. Areas Commun., vol.27, no.5, pp. 699-712, 2009.
41. Z. Quan, W.-K. Ma, S. Cui, and A. Sayed, "Optimal linear fusion for distributed detection via semidefinite programming," IEEE Trans. Signal Processing, to be published.
42. M. Grant, S. Boyd, and Y. Ye. (2009). CVX: MATLAB software for disciplined convex programming [Online]. Available: http://www.stanford.edu/ ~boyd/cvx
43. Y. Ye, Interior Point Algorithms: Theory and Analysis (Wiley-Interscience Series in Discrete Mathematics and Optimization). New York: Wiley, 1997.
44. C. Helmberg, F. Rendl, R. Vanderbei, and H. Wolkowicz, "An interior-point method for semidefinite programming," SIAM J. Optim., vol.6, no.2, pp. 342-361, 1996.
45. W.-K. Ma, C.-C. Su, J. Jaldén, and C.-Y. Chi, "Some results on 16-QAM MIMO detection using semidefinite relaxation," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Las Vegas, NV, Apr. 2008, pp. 2673-2676.
46. J. F. Sturm. (1999). Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. [Online]. vol.11-12, pp. 625-653. Available: http://sedumi.ie.lehigh.edu/
47. J. Mattingley and S. Boyd, "Real-time convex optimization in signal processing," IEEE Signal Processing Mag., vol.27, no.3, pp. 50-61, 2010.
48. L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Rev., vol.38, no.1, pp. 49-95, 1996.
49. M. O. Damen, H. E. Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol.49, no.10, pp. 2389-2402, 2003.
50. S. Verdú, "Computational complexity of optimum multiuser detection," Al-gorithmica, vol.4, no.1-4, pp. 303-312, 1989.
51. J. Jaldén and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Processing, vol.53, no.4, pp. 1474-1484, 2005. (Pubitemid 40535696)
52. A. Wiesel, Y. C. Eldar, and S. Shamai, "Semidefinite relaxation for detection of 16-QAM signaling in MIMO channels," IEEE Signal Processing Lett., vol.12, no.9, pp. 653-656, 2005. (Pubitemid 41554407)
53. N. D. Sidiropoulos and Z.-Q. Luo, "A semidefinite relaxation approach to MIMO detection for higher-order constellations," IEEE Signal Processing Lett., vol.13, no.9, pp. 525-528, 2006.
54. Z. Mao, X. Wang, and X. Wang, "Semidefinite programming relaxation approach for multiuser detection of QAM signals," IEEE Trans. Wireless Commun., vol.6, no.12, pp. 4275-4279, 2007. (Pubitemid 350249463)
55. Y. Yang, C. Zhao, P. Zhou, and W. Xu, "MIMO detection of 16-QAM signaling based on semidefinite relaxation," IEEE Signal Processing Lett., vol.14, no.11, pp. 797-800, 2007. (Pubitemid 351409109)
56. M. Nekuii, M. Kisialiou, T. N. Davidson, and Z.-Q. Luo, "Efficient soft demodulation of MIMO QPSK via semidefinite relxation," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Las Vegas, NV, Mar. 2008, pp. 2665-2668.
57. J. Jaldén, B. Ottersten, and W.-K. Ma, "Reducing the average complexity of ML detection using semidefinite relaxation," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Philadelphia, PA, Mar. 2005, pp. 1021-1024.
58. J. Jaldén and B. Ottersten, "The diversity order of the semidefinite relaxation detector," IEEE Trans. Inform. Theory, vol.54, no.4, pp. 1406-1422, Apr. 2008. (Pubitemid 351512978)
59. M. Kisialiou and Z.-Q. Luo, "Performance analysis of quasi-maximum-likelihood detector based on semi-definite programming," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Philadelphia, PA, Mar. 2005, pp. 433-436.
60. A. M.-C. So and Y. Ye, "Probabilistic analysis of semidefinite relaxation detectors in multiple-input, multiple-output systems," in Convex Optimization in Signal Processing and Communications, D. P. Palomar and Y. C. Eldar, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2010, ch. 5.
61. N. D. Sidiropoulos, T. N. Davidson, and Z.-Q. Luo, "Transmit beamforming for physical-layer multicasting," IEEE Trans. Signal Processing, vol.54, no.6, pp. 2239-2251, 2006.
62. A. M.-C. So, Y. Ye, and J. Zhang, "A unified theorem on SDP rank reduction," Math. Oper. Res., vol.33, no.4, pp. 910-920, 2008.
63. Y. J. Zhang and A. M.-C. So, "Optimal spectrum sharing in MIMO cognitive radio networks via semidefinite programming," Preprints, 2009, submitted for publication.
64. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
65. M. Bengtsson and B. Ottersten, "Optimal and suboptimal transmit beam-forming," in Handbook of Antennas in Wireless Communications, L. C. Godara, Ed. Boca Raton, FL: CRC, Aug. 2001, ch. 18, pp. 18-1-18-33.
66. Y. Ye. (1995). Convergence behavior of central paths for convex homogeneous self-dual cones [Online]. Available: http://www.stanford.edu/~yyye/ yyye/ye.ps
67. A. Shapiro, "Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis," Psychometrika, vol.47, no.2, pp. 187-199, 1982.
68. A. I. Barvinok, "Problems of distance geometry and convex properties of quadratic maps," Discrete Comput. Geometry, vol.13, no.1, pp. 189-202, 1995.
69. G. Pataki, "On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues," Math. Oper. Res., vol.23, no.2, pp. 339-358, 1998. (Pubitemid 128508667)
70. W. Ai and S. Zhang, "Strong duality for the CDT subproblem: A necessary and sufficient condition," SIAM J. Optim., vol.19, no.4, pp. 1735-1756, 2009.
71. W. Ai, Y. W. Huang, and S. Zhang, "New results on Hermitian matrix rank-one decomposition," Math. Program., to be published.
72. A. Beck and Y. C. Eldar, "Regularization in regression with bounded noise: A Chebyshev center approach," SIAM J. Matrix Anal. Appl., vol.29, no.2, pp. 606-625, May 2007. (Pubitemid 351599154)
73. A. Beck and Y. C. Eldar, "Doubly constrained robust Capon beamformer with ellipsoidal uncertainty sets," IEEE Trans. Signal Processing, vol.55, no.2, pp. 753-758, Jan. 2007. (Pubitemid 46351302)
74. Y. C. Eldar, A. Beck, and M. Teboulle, "A minimax Chebyshev estimator for bounded error estimation," IEEE Trans. Signal Processing, vol.56, no.4, pp. 1388-1397, Apr. 2008. (Pubitemid 351493835)
75. Y. W. Huang, A. De Maio, and S. Zhang, "Semidefinite programming, matrix decomposition, and radar code design," in Convex Optimization in Signal Processing and Communications, D. P. Palomar and Y. C. Eldar, Eds. Cambridge, U.K.: Cambridge Univ. Press, 2010, ch. 6.
76. J. Jaldén, C. Martin, and B. Ottersten, "Semidefinite programming for detection in linear systems\optimality conditions and space-time coding," in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Hong Kong, China, Apr. 2003, pp. 9-12.
77. Y. T. Chan and K. C. Ho, "A simple and efficient estimator for hyperbolic location," IEEE Trans. Signal Processing, vol.42, no.8, pp. 1905-1915, 1994.
78. K. W. Cheung, H. C. So, W.-K. Ma, and Y. T. Chan, "Least squares algorithms for time-of-arrival-based mobile location," IEEE Trans. Signal Processing, vol.52, no.4, pp. 1121-1128, 2004.
79. J. B. Saxe, "Embeddability of weighted graphs in k-space is strongly NP-hard," in Proc. 17th Annu. Allerton Conf. Communication, Control, and Computing, 1979, pp. 480-489.
80. A. M.-C. So and Y. Ye, "A semidefinite programming approach to tensegrity theory and realizability of graphs," in Proc. 17th Annu. ACM-SIAM Symp. Discrete Algorithms, Miami, FL, Jan. 2006, pp. 766-775.