Self-calibration and biconvex compressive sensing

DOI10.1088/0266-5611/31/11/115002zbMath1327.93183arXiv1501.06864OpenAlexW3104684837MaRDI QIDQ3458212

Thomas Strohmer, Shuyang Ling

Publication date: 18 December 2015

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.06864

zbMATH Keywords

matrix completionconvex programmingrandom matrixsparsitycompressive sensingself-calibrationbiconvex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Applications of optimal control and differential games (49N90) Design techniques (robust design, computer-aided design, etc.) (93B51) Linear systems in control theory (93C05)

Related Items

Efficient Identification of Butterfly Sparse Matrix Factorizations, The numerics of phase retrieval, Admissible measurements and robust algorithms for ptychography, Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems, A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization, Time for dithering: fast and quantized random embeddings via the restricted isometry property, Stochastic Model-Based Minimization of Weakly Convex Functions, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, Multichannel blind deconvolution via maximum likelihood estimator: application in neural recordings, Reconstruction Methods in THz Single-Pixel Imaging, Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent, Level-set methods for convex optimization, Sparse power factorization: balancing peakiness and sample complexity, Self-Calibration and Bilinear Inverse Problems via Linear Least Squares, Low-Rank Spectral Optimization via Gauge Duality, Sensor calibration for off-the-grid spectral estimation, Hyperbolic Wavelet Frames and Multiresolution in the Weighted Bergman Spaces, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence, Solving equations of random convex functions via anchored regression, Blind Deconvolution by a Steepest Descent Algorithm on a Quotient Manifold, BranchHull: convex bilinear inversion from the entrywise product of signals with known signs, A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces, Rapid, robust, and reliable blind deconvolution via nonconvex optimization, Plug in estimation in high dimensional linear inverse problems a rigorous analysis, Multilinear Compressive Sensing and an Application to Convolutional Linear Networks, Geometry and Symmetry in Short-and-Sparse Deconvolution

Uses Software

• CVX
• Yall1
• PhaseLift
• Wirtinger Flow

Cites Work

• A mathematical introduction to compressive sensing
• Von Neumann entropy penalization and low-rank matrix estimation
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• User-friendly tail bounds for sums of random matrices
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• Eigenstructure methods for direction finding with sensor gain and phase uncertainties
• Exact matrix completion via convex optimization
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Sparse Signal Recovery from Quadratic Measurements via Convex Programming
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Blind Deconvolution Using Convex Programming
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization
• Sensitivity to Basis Mismatch in Compressed Sensing
• An Eigenstructure Method for Estimating DOA and Sensor Gain-Phase Errors
• Convex Optimization Approaches for Blind Sensor Calibration Using Sparsity
• A Probabilistic and RIPless Theory of Compressed Sensing
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Sparsity and incoherence in compressive sampling
• The Rotation of Eigenvectors by a Perturbation. III
• Phase Retrieval via Matrix Completion
• Compressed sensing