Recovery under side constraints (Q2106480)

From MaRDI portal

Revision as of 02:52, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Recovery under side constraints

scientific article

Language	Label	Description	Also known as
English	Recovery under side constraints	scientific article

Statements

scholarly article

0 references

Recovery under side constraints (English)

0 references

0 references

0 references

0 references

Frederic Matter

0 references

Marius Pesavento

0 references

Marc E. Pfetsch

0 references

publication date

14 December 2022

0 references

full work available at URL

https://arxiv.org/abs/2106.09375

0 references

zbMATH Keywords

sparse signal reconstruction

0 references

measurement system design

0 references

MaRDI profile type

0 references

Noisy Compressive Sampling Based on Block-Sparse Tensors: Performance Limits and Beamforming Techniques

0 references

Compressed sensing

0 references

The numerics of phase retrieval

0 references

Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints

0 references

Branch-and-cut for linear programs with overlapping SOS1 constraints

0 references

A mathematical introduction to compressive sensing

0 references

Sparse representations in unions of bases

0 references

Block-sparse recovery of semidefinite systems and generalized null space conditions

0 references

Direction-of-Arrival Estimation Using a Mixed $\ell _{2,0}$ Norm Approximation

0 references

Sparse Phase Retrieval: Uniqueness Guarantees and Recovery Algorithms

0 references

On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures

0 references

Compressed sensing for finite-valued signals

0 references

Sparse Recovery of Nonnegative Signals With Minimal Expansion

0 references

0 references

Sparse regression using mixed norms

0 references

A Novel Convex Relaxation for Non-binary Discrete Tomography

0 references

Sparse recovery with integrality constraints

0 references

Sparse Signal Recovery from Quadratic Measurements via Convex Programming

0 references

A sparse signal reconstruction perspective for source localization with sensor arrays

0 references

Phase Retrieval Using Alternating Minimization

0 references

Undersampled Sparse Phase Retrieval via Majorization–Minimization

0 references

GESPAR: Efficient Phase Retrieval of Sparse Signals

0 references

Block- and Rank-Sparse Recovery for Direction Finding in Partly Calibrated Arrays

0 references

A Compact Formulation for the $\ell _{2,1}$ Mixed-Norm Minimization Problem

0 references

Deterministic Cramér-Rao Bound for Strictly Non-Circular Sources and Analytical Analysis of the Achievable Gains

0 references

Performance Analysis of Multi-Dimensional ESPRIT-Type Algorithms for Arbitrary and Strictly Non-Circular Sources With Spatial Smoothing

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing

0 references

DOLPHIn—Dictionary Learning for Phase Retrieval

0 references

Algorithms for simultaneous sparse approximation. II: Convex relaxation

0 references

Designing structured tight frames via an alternating projection method

0 references

Sparse Phase Retrieval via Truncated Amplitude Flow

0 references

A Unified Successive Pseudoconvex Approximation Framework

0 references

Energy Efficiency Optimization in MIMO Interference Channels: A Successive Pseudoconvex Approximation Approach

0 references

Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization

0 references

Model Selection and Estimation in Regression with Grouped Variables

0 references

Sensing Matrix Optimization for Block-Sparse Decoding

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-09745-4_7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2106480

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2106480&oldid=37472405"