Rapid, robust, and reliable blind deconvolution via nonconvex optimization
Authors:
- Xiaodong LiXLXiaodong Li
- Shuyang LingSLShuyang Ling
- Thomas StrohmerTSThomas Strohmer
- Ke WeiKWKe Wei
- 1 November 2019
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 47 (3) , 893-934
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation of Sri Lanka (DTRA-DMS 1322393)
This publication has 17 references indexed in Scilit:
- Phase Retrieval via Wirtinger Flow: Theory and AlgorithmsIEEE Transactions on Information Theory, 2015
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex ProgrammingCommunications on Pure and Applied Mathematics, 2012
- Von Neumann entropy penalization and low-rank matrix estimationThe Annals of Statistics, 2011
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completionThe Annals of Statistics, 2011
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Four short stories about Toeplitz matrix calculationsLinear Algebra and its Applications, 2002
- Total variation blind deconvolutionIEEE Transactions on Image Processing, 1998
- Blind equalization and multiuser detection in dispersive CDMA channelsIEEE Transactions on Communications, 1998
- Blind channel identification based on second-order statistics: a frequency-domain approachIEEE Transactions on Information Theory, 1995
- Restoration of Astronomical Images by Iterative Blind DeconvolutionThe Astrophysical Journal, 1993