Recovery under side constraints
From MaRDI portal
Publication:2106480
DOI10.1007/978-3-031-09745-4_7zbMATH Open1504.94026arXiv2106.09375OpenAlexW3172841629MaRDI QIDQ2106480FDOQ2106480
Tianyi Liu, Marius Pesavento, Khaled Ardah, Marc E. Pfetsch, Martin Haardt, Frederic Matter
Publication date: 14 December 2022
Abstract: This paper addresses sparse signal reconstruction under various types of structural side constraints with applications in multi-antenna systems. Side constraints may result from prior information on the measurement system and the sparse signal structure. They may involve the structure of the sensing matrix, the structure of the non-zero support values, the temporal structure of the sparse representationvector, and the nonlinear measurement structure. First, we demonstrate how a priori information in form of structural side constraints influence recovery guarantees (null space properties) using L1-minimization. Furthermore, for constant modulus signals, signals with row-, block- and rank-sparsity, as well as non-circular signals, we illustrate how structural prior information can be used to devise efficient algorithms with improved recovery performance and reduced computational complexity. Finally, we address the measurement system design for linear and nonlinear measurements of sparse signals. Moreover, we discuss the linear mixing matrix design based on coherence minimization. Then we extend our focus to nonlinear measurement systems where we design parallel optimization algorithms to efficiently compute stationary points in the sparse phase retrieval problem with and without dictionary learning.
Full work available at URL: https://arxiv.org/abs/2106.09375
Recommendations
Cites Work
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Model Selection and Estimation in Regression with Grouped Variables
- Compressed sensing
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- A mathematical introduction to compressive sensing
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse regression using mixed norms
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- Designing structured tight frames via an alternating projection method
- Sparse recovery with integrality constraints
- Sparse representations in unions of bases
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparse signal recovery from quadratic measurements via convex programming
- Title not available (Why is that?)
- Sensing Matrix Optimization for Block-Sparse Decoding
- Compressed sensing for finite-valued signals
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- The numerics of phase retrieval
- Phase Retrieval Using Alternating Minimization
- A Unified Successive Pseudoconvex Approximation Framework
- Direction-of-Arrival Estimation Using a Mixed $\ell _{2,0}$ Norm Approximation
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Undersampled Sparse Phase Retrieval via Majorization–Minimization
- Sparse Phase Retrieval via Truncated Amplitude Flow
- Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- DOLPHIn—Dictionary Learning for Phase Retrieval
- Performance Analysis of Multi-Dimensional ESPRIT-Type Algorithms for Arbitrary and Strictly Non-Circular Sources With Spatial Smoothing
- Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms
- Deterministic Cramér-Rao Bound for Strictly Non-Circular Sources and Analytical Analysis of the Achievable Gains
- Noisy Compressive Sampling Based on Block-Sparse Tensors: Performance Limits and Beamforming Techniques
- Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays
- A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem
- Energy Efficiency Optimization in MIMO Interference Channels: A Successive Pseudoconvex Approximation Approach
- A Novel Convex Relaxation for Non-binary Discrete Tomography
Cited In (3)
This page was built for publication: Recovery under side constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106480)