Show simple item record

dc.contributor.authorPlumbley, MDen_US
dc.date.accessioned2013-07-23T09:42:10Z
dc.date.issued2007-09en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/4199
dc.format.extent3188 - 3195en_US
dc.relation.ispartofIEEE T INFORM THEORYen_US
dc.rightsCopyright 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This is the accepted version of the article. The published version is available at <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4294168&isnumber=4294144>.
dc.subjectBasis pursuit (BP)en_US
dc.subjectorthogonal matching pursuit (OMP)en_US
dc.subjectlinear programmingen_US
dc.subjectpolytopesen_US
dc.subjectsparse representationsen_US
dc.subjectBASESen_US
dc.subjectDICTIONARIESen_US
dc.subjectMINIMIZATIONen_US
dc.titleOn polar polytopes and the recovery of sparse representationsen_US
dc.typeArticle
dc.identifier.doi10.1109/TIT.2007.903129en_US
pubs.issue9en_US
pubs.notesNot knownen_US
pubs.volume53en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record