Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection

DOI10.1137/17M115075XzbMath1412.90104arXiv1710.02048OpenAlexW2963694619WikidataQ128284948 ScholiaQ128284948MaRDI QIDQ4629340

Cheng Lu, Ya-Feng Liu, Shu-Zhong Zhang, Wei-Qiang Zhang

Publication date: 22 March 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.02048

zbMATH Keywords

semidefinite relaxationcomplex quadratic programmingMIMO detectiontight relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items (7)

A note on the SDP relaxation of the minimum cut problem ⋮ A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ New semidefinite relaxations for a class of complex quadratic programming problems ⋮ Globally solving extended trust region subproblems with two intersecting cuts ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Angular synchronization by eigenvectors and semidefinite programming
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• Complementarity and nondegeneracy in semidefinite programming
• Optimal estimation of sensor biases for asynchronous multi-sensor data fusion
• Computational complexity of optimum multiuser detection
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Phase recovery, MaxCut and complex semidefinite programming
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Nonconvex Phase Synchronization
• Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
• A unified framework for tree search decoding: rediscovering the sequential decoder
• A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
• The Diversity Order of the Semidefinite Relaxation Detector
• Method of obtaining estimates in quadratic extremal problems with Boolean variables
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
• Designing Unimodular Codes Via Quadratic Optimization
• On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
• An Efficient Global Algorithm for Single-Group Multicast Beamforming
• Decision feedback multiuser detection: a systematic approach
• Blind adaptive multiuser detection
• Complex Quadratic Optimization and Semidefinite Programming

This page was built for publication: Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection