Support Recovery of Greedy Block Coordinate Descent Using the Near Orthogonality Property
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-04-27
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
In this paper, using the near orthogonal property, we analyze the performance of greedy block coordinate descent (GBCD) algorithm when both the measurements and the measurement matrix are perturbed by some errors.
An improved sufficient condition is presented to guarantee that the support of the sparse matrix is recovered exactly.
A counterexample is provided to show that GBCD fails.
It improves the existing result.
By experiments, we also point out that GBCD is robust under these perturbations.
American Psychological Association (APA)
Li, Haifeng. 2017. Support Recovery of Greedy Block Coordinate Descent Using the Near Orthogonality Property. Mathematical Problems in Engineering،Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1190525
Modern Language Association (MLA)
Li, Haifeng. Support Recovery of Greedy Block Coordinate Descent Using the Near Orthogonality Property. Mathematical Problems in Engineering No. 2017 (2017), pp.1-7.
https://search.emarefa.net/detail/BIM-1190525
American Medical Association (AMA)
Li, Haifeng. Support Recovery of Greedy Block Coordinate Descent Using the Near Orthogonality Property. Mathematical Problems in Engineering. 2017. Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1190525
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1190525