An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
DOI10.1137/20M1346912zbMath1470.90071arXiv2006.12123OpenAlexW3168793198MaRDI QIDQ4997173
Wei-Kun Chen, Ya-Feng Liu, Ping-Fan Zhao, Qing-Na Li
Publication date: 28 June 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.12123
semidefinite relaxationprojected Newton methodquadratic penalty methodMIMO detectionsparse quadratic programming relaxation
Semidefinite programming (90C22) Quadratic programming (90C20) Communication networks in operations research (90B18) Combinatorial optimization (90C27)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A quadratic penalty method for hypergraph matching
- Factoring polynomials with rational coefficients
- Computational complexity of optimum multiuser detection
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Joint signal detection and parameter estimation in multiuser communications
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Projected Newton Methods for Optimization Problems with Simple Constraints
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- On the complexity of sphere decoding in digital communications
This page was built for publication: An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
