Beyond semidefinite relaxation: Basis banks and computationally enhanced guarantees
暂无分享,去创建一个
[1] L. J. Boya,et al. On Regular Polytopes , 2012, 1210.0601.
[2] George N. Karystinos,et al. Efficient computation of the binary vector that maximizes a rank-deficient quadratic form , 2010, IEEE Trans. Inf. Theory.
[3] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..
[4] Alberto Seeger,et al. Deterministic and stochastic methods for computing volumetric moduli of convex cones , 2010 .
[5] Jian Li,et al. Exact and Approximate Solutions of Source Localization Problems , 2008, IEEE Transactions on Signal Processing.
[6] Nikos D. Sidiropoulos,et al. A Semidefinite Relaxation Approach to MIMO Detection for High-Order QAM Constellations , 2006, IEEE Signal Processing Letters.
[7] Björn E. Ottersten,et al. Semidefinite programming for detection in linear systems - optimality conditions and space-time decoding , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..
[8] Anthony Man-Cho So,et al. On approximating complex quadratic optimization problems via semidefinite programming relaxations , 2005, IPCO.
[9] Antonio De Maio,et al. Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint , 2011, IEEE Transactions on Signal Processing.
[10] Petre Stoica,et al. Designing Unimodular Codes Via Quadratic Optimization , 2013, IEEE Transactions on Signal Processing.
[11] Alberto Seeger,et al. Centers and partial volumes of convex cones I. Basic theory , 2015 .
[12] Y. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization , 1998 .
[13] Zhi-Quan Luo,et al. Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.
[14] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[15] Björn E. Ottersten,et al. The Diversity Order of the Semidefinite Relaxation Detector , 2006, IEEE Transactions on Information Theory.
[16] Augusto Aubry,et al. A Doppler Robust Design of Transmit Sequence and Receive Filter in the Presence of Signal-Dependent Interference , 2014, IEEE Transactions on Signal Processing.
[17] B. Hassibi,et al. On the expected complexity of sphere decoding , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).
[18] Anastasios Kyrillidis,et al. Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).