4 papers
A Scalable and Exact Relaxation for Densest -Subgraph via Error Bounds
Ya Liu, Junbin Liu, Wing-Kin Ma +1
Given an undirected graph and a size parameter , the Densest -Subgraph (DS) problem extracts the subgraph on vertices with the largest number of induced edges. While D…
Downlink MIMO Channel Estimation from Bits: Recoverability and Algorithm
Rajesh Shrestha, Mingjie Shao, Mingyi Hong +2
In frequency division duplex (FDD) massive MIMO systems, a major challenge lies in acquiring the downlink channel state information}\ (CSI) at the base station (BS) from limited fe…
Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications
Junbin Liu, Ya Liu, Wing-Kin Ma +2
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques wer…
Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
Junbin Liu, Ya Liu, Wing-Kin Ma +2
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix cons…