activity
20172021
most citedAn Efficient Global Algorithm for Single-Group Multicast Beamforming

63 citations · 70 across the 6 of their papers we have counts for

collaborators

6 papers

cs.DS2021★ 1 cited

Regularized Non-monotone Submodular Maximization

Cheng Lu, Wenguo Yang, Suixiang Gao

In this paper, we present a thorough study of maximizing a regularized non-monotone submodular function subject to various constraints, i.e., $\max \{ g(A) - \ell(A) : A \in \mathc…

stat.ML2021★ 5 cited

Implicit Normalizing Flows

Cheng Lu, Jianfei Chen, Chongxuan Li +2

Normalizing flows define a probability distribution by an explicit invertible transformation . In this work, we present implicit…

cs.IT2019

On the Equivalence of Semidifinite Relaxations for MIMO Detection with General Constellations

Ya-Feng Liu, Zi Xu, Cheng Lu

The multiple-input multiple-output (MIMO) detection problem is a fundamental problem in modern digital communications. Semidefinite relaxation (SDR) based algorithms are a popular…

cs.IT2019

An Enhanced SDR based Global Algorithm for Nonconvex Complex Quadratic Programs with Signal Processing Applications

Cheng Lu, Ya-Feng Liu, Jing Zhou

In this paper, we consider a class of nonconvex complex quadratic programming (CQP) problems, which find a broad spectrum of signal processing applications. By using the polar coor…

math.OC2017★ 1 cited

Tightness of a new and enhanced semidefinite relaxation for MIMO detection

Cheng Lu, Ya-Feng Liu, Wei-Qiang Zhang +1

In this paper, we consider a fundamental problem in modern digital communications known as multi-input multi-output (MIMO) detection, which can be formulated as a complex quadratic…

cs.IT2017★ 63 cited

An Efficient Global Algorithm for Single-Group Multicast Beamforming

Cheng Lu, Ya-Feng Liu

Consider the single-group multicast beamforming problem, where multiple users receive the same data stream simultaneously from a single transmitter. The problem is NP-hard and all…