activity
20192026
most citedStructured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion

20 citations · 58 across the 11 of their papers we have counts for

collaborators
Showing math.NAShow all

5 papers · 1 filter

math.NA2026

Near-Optimal Nonconvex Matrix Completion

Jian-Feng Cai, Xiliang Lu, Juntao You

We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries. Convex methods achieve sample complexity linear in the m…

math.NA2026

Off-Grid Point-Scatterer Localization from Sparse Limited-Aperture Data via Hankel Completion

Jingzhi Li, Xiliang Lu, Juntao You

We study the localization of distinct planar point scatterers from sparsely sampled single-incidence, single-frequency acoustic far-field data over a limited receiver aperture.…

math.NA2024

GraHTP: A Provable Newton-like Algorithm for Sparse Phase Retrieval

Licheng Dai, Xiliang Lu, Juntao You

This paper investigates the sparse phase retrieval problem, which aims to recover a sparse signal from a system of quadratic measurements. In this work, we propose a novel non-conv…

math.NA2021★ 10 cited

Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization

Jian-Feng Cai, Yuling Jiao, Xiliang Lu +1

In this work we propose a nonconvex two-stage \underline{s}tochastic \underline{a}lternating \underline{m}inimizing (SAM) method for sparse phase retrieval. The proposed algorithm…

math.NA2020★ 16 cited

Sparse Signal Recovery from Phaseless Measurements via Hard Thresholding Pursuit

Jian-Feng Cai, Jingzhi Li, Xiliang Lu +1

In this paper, we consider the sparse phase retrieval problem, recovering an -sparse signal from phaseless samples $y_i=|\langle\bm{x}^{\n…