The algorithm for the recovery of integer vector via linear measurements

05/07/2019
by   K. S. Ryutin, et al.
0

In this paper we continue the studies on the integer sparse recovery problem that was introduced in FKS and studied in K,KS. We provide an algorithm for the recovery of an unknown sparse integer vector for the measurement matrix described in KS and estimate the number of arithmetical operations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2019

An extremal problem for integer sparse recovery

Motivated by the problem of integer sparse recovery we study the followi...
research
03/04/2022

An SDP Relaxation for the Sparse Integer Least Square Problem

In this paper, we study the sparse integer least square problem (SILS), ...
research
07/23/2018

Batch Sparse Recovery, or How to Leverage the Average Sparsity

We introduce a batch version of sparse recovery, where the goal is to re...
research
11/07/2017

Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors

While single measurement vector (SMV) models have been widely studied in...
research
11/03/2019

Testing noisy linear functions for sparsity

We consider the following basic inference problem: there is an unknown h...
research
01/31/2023

Support Exploration Algorithm for Sparse Support Recovery

We introduce a new algorithm promoting sparsity called Support Explorati...
research
11/14/2019

Predicting sparse circle maps from their dynamics

The problem of identifying a dynamical system from its dynamics is of gr...

Please sign up or login with your details

Forgot password? Click here to reset