Minimum subspace approximation property for sparse approximations in finite dimension

Akram Aldroubi, Romian Tessera

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝd.

Original languageEnglish
Title of host publication2010 44th Annual Conference on Information Sciences and Systems, CISS 2010
DOIs
Publication statusPublished - 24 Jun 2010
Externally publishedYes
Event44th Annual Conference on Information Sciences and Systems, CISS 2010 - Princeton, NJ, United States
Duration: 17 Mar 201019 Mar 2010

Publication series

Name2010 44th Annual Conference on Information Sciences and Systems, CISS 2010

Conference

Conference44th Annual Conference on Information Sciences and Systems, CISS 2010
Country/TerritoryUnited States
CityPrinceton, NJ
Period17/03/1019/03/10

Fingerprint

Dive into the research topics of 'Minimum subspace approximation property for sparse approximations in finite dimension'. Together they form a unique fingerprint.

Cite this