annotate toolboxes/alps/Report_bibtex.bib @ 203:f3b6ddd2f04f
luisf_dev
checks if the variable SMALL_path exists, and exits otherwise.
author |
luisf <luis.figueira@eecs.qmul.ac.uk> |
date |
Tue, 20 Mar 2012 15:52:22 +0000 |
parents |
0de08f68256b |
children |
|
rev |
line source |
ivan@154
|
1 @comment{ generated by <http://infoscience.epfl.ch/> }
|
ivan@154
|
2
|
ivan@154
|
3 @TechReport{EPFL-REPORT-162761,
|
ivan@154
|
4 abstract = {We propose and analyze acceleration schemes for hard
|
ivan@154
|
5 thresholding methods with applications to sparse
|
ivan@154
|
6 approximation in linear inverse systems. Our acceleration
|
ivan@154
|
7 schemes fuse combinatorial, sparse projection algorithms
|
ivan@154
|
8 with convex optimization algebra to provide
|
ivan@154
|
9 computationally efficient and robust sparse recovery
|
ivan@154
|
10 methods. We compare and contrast the (dis)advantages of
|
ivan@154
|
11 the proposed schemes with the state-of-the-art, not only
|
ivan@154
|
12 within hard thresholding methods, but also within convex
|
ivan@154
|
13 sparse recovery algorithms.},
|
ivan@154
|
14 affiliation = {EPFL},
|
ivan@154
|
15 author = {Cevher, Volkan},
|
ivan@154
|
16 details = {http://infoscience.epfl.ch/record/162761},
|
ivan@154
|
17 documenturl = {http://infoscience.epfl.ch/record/162761/files/techreport.pdf},
|
ivan@154
|
18 keywords = {structured sparsity; sparse recovery; hard thresholding},
|
ivan@154
|
19 oai-id = {oai:infoscience.epfl.ch:162761},
|
ivan@154
|
20 oai-set = {report; fulltext; fulltext-public},
|
ivan@154
|
21 status = {PUBLISHED},
|
ivan@154
|
22 submitter = {199128; 199128},
|
ivan@154
|
23 title = {On {A}ccelerated {H}ard {T}hresholding {M}ethods for
|
ivan@154
|
24 {S}parse {A}pproximation},
|
ivan@154
|
25 unit = {LIONS},
|
ivan@154
|
26 year = 2011
|
ivan@154
|
27 }
|