Loading…
Weak Stability of -Minimization Methods in Sparse Data Reconstruction
As one of the most plausible convex optimization methods for sparse data reconstruction, [l.sub.1]-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricte...
Saved in:
| Published in: | Mathematics of operations research 2019-02, Vol.44 (1), p.173 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | |
| container_end_page | |
| container_issue | 1 |
| container_start_page | 173 |
| container_title | Mathematics of operations research |
| container_volume | 44 |
| creator | Zhao, Yun-Bin Jiang, Houyuan Luo, Zhi-Quan |
| description | As one of the most plausible convex optimization methods for sparse data reconstruction, [l.sub.1]-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricted isometry property, null space property, and mutual coherence. In this paper, we propose a unified means to develop the so-called weak stability theory for [l.sub.1]-minimization methods under the condition called the weak range space property of a transposed design matrix, which turns out to be a necessary and sufficient condition for the standard [l.sub.1]-minimization method to be weakly stable in sparse data reconstruction. The reconstruction error bounds established in this paper are measured by the so-called Robinson's constant. We also provide a unified weak stability result for standard [l.sub.1]-minimization under several existing compressed sensing matrix properties. In particular, the weak stability of this method under the constant-free range space property of the transposed design matrix is established, to our knowledge, for the first time in this paper. Different from the existing analysis, we utilize the classic Hoffman's lemma concerning the error bound of linear systems as well as Dudley's theorem concerning the polytope approximation of the unit ball to show that [l.sub.1]-minimization is robustly and weakly stable in recovering sparse data from inaccurate measurements. |
| doi_str_mv | 10.1287/moor.2017.0919 |
| format | article |
| fullrecord | <record><control><sourceid>gale</sourceid><recordid>TN_cdi_gale_infotracmisc_A578274148</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A578274148</galeid><sourcerecordid>A578274148</sourcerecordid><originalsourceid>FETCH-LOGICAL-g2078-a9a4a8ae5c33d4f486caa0206636b83a23da791418abfe02ead4304493bb234a3</originalsourceid><addsrcrecordid>eNp1zE1Lw0AQBuBFFKzVq-cFQRBM3K9kk2OpVQstQqvorUySTbqa7Ep2C-qvN1IPDVQGZuDleQehc0pCyhJ501jbhoxQGZKUpgdoQCMWB5GQ9BANCI9FIOPo9RidOPdGCI0kFQM0eVHwjpceMl1r_4VtiYO5NrrR3-C1NXiu_NoWDmuDlx_QOoVvwQNeqNwa59tN_qtO0VEJtVNnf3eInu8mT-OHYPZ4Px2PZkHFiEwCSEFAAirKOS9EKZI4ByCMxDGPs4QD4wXIlAqaQFYqwhQUghMhUp5ljAvgQ3Sx_VtBrVbalNa3kDfa5atRJBMmBRVJp4I9qlJGtVBbo0rdxT0f7vHdFKrR-d7CZa_QGa8-fQUb51Z9ePU_nC4XfXu9Y7ON00a5bjldrb3bVnb4D7_ilkg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Weak Stability of -Minimization Methods in Sparse Data Reconstruction</title><source>Business Source Ultimate</source><creator>Zhao, Yun-Bin ; Jiang, Houyuan ; Luo, Zhi-Quan</creator><creatorcontrib>Zhao, Yun-Bin ; Jiang, Houyuan ; Luo, Zhi-Quan</creatorcontrib><description>As one of the most plausible convex optimization methods for sparse data reconstruction, [l.sub.1]-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricted isometry property, null space property, and mutual coherence. In this paper, we propose a unified means to develop the so-called weak stability theory for [l.sub.1]-minimization methods under the condition called the weak range space property of a transposed design matrix, which turns out to be a necessary and sufficient condition for the standard [l.sub.1]-minimization method to be weakly stable in sparse data reconstruction. The reconstruction error bounds established in this paper are measured by the so-called Robinson's constant. We also provide a unified weak stability result for standard [l.sub.1]-minimization under several existing compressed sensing matrix properties. In particular, the weak stability of this method under the constant-free range space property of the transposed design matrix is established, to our knowledge, for the first time in this paper. Different from the existing analysis, we utilize the classic Hoffman's lemma concerning the error bound of linear systems as well as Dudley's theorem concerning the polytope approximation of the unit ball to show that [l.sub.1]-minimization is robustly and weakly stable in recovering sparse data from inaccurate measurements.</description><identifier>ISSN: 0364-765X</identifier><identifier>EISSN: 1526-5471</identifier><identifier>DOI: 10.1287/moor.2017.0919</identifier><language>eng</language><publisher>Institute for Operations Research and the Management Sciences</publisher><subject>Analysis ; Data recovery ; Mathematical optimization ; Mathematical research ; Methods</subject><ispartof>Mathematics of operations research, 2019-02, Vol.44 (1), p.173</ispartof><rights>COPYRIGHT 2019 Institute for Operations Research and the Management Sciences</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,786,790,27957,27958</link.rule.ids></links><search><creatorcontrib>Zhao, Yun-Bin</creatorcontrib><creatorcontrib>Jiang, Houyuan</creatorcontrib><creatorcontrib>Luo, Zhi-Quan</creatorcontrib><title>Weak Stability of -Minimization Methods in Sparse Data Reconstruction</title><title>Mathematics of operations research</title><description>As one of the most plausible convex optimization methods for sparse data reconstruction, [l.sub.1]-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricted isometry property, null space property, and mutual coherence. In this paper, we propose a unified means to develop the so-called weak stability theory for [l.sub.1]-minimization methods under the condition called the weak range space property of a transposed design matrix, which turns out to be a necessary and sufficient condition for the standard [l.sub.1]-minimization method to be weakly stable in sparse data reconstruction. The reconstruction error bounds established in this paper are measured by the so-called Robinson's constant. We also provide a unified weak stability result for standard [l.sub.1]-minimization under several existing compressed sensing matrix properties. In particular, the weak stability of this method under the constant-free range space property of the transposed design matrix is established, to our knowledge, for the first time in this paper. Different from the existing analysis, we utilize the classic Hoffman's lemma concerning the error bound of linear systems as well as Dudley's theorem concerning the polytope approximation of the unit ball to show that [l.sub.1]-minimization is robustly and weakly stable in recovering sparse data from inaccurate measurements.</description><subject>Analysis</subject><subject>Data recovery</subject><subject>Mathematical optimization</subject><subject>Mathematical research</subject><subject>Methods</subject><issn>0364-765X</issn><issn>1526-5471</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp1zE1Lw0AQBuBFFKzVq-cFQRBM3K9kk2OpVQstQqvorUySTbqa7Ep2C-qvN1IPDVQGZuDleQehc0pCyhJ501jbhoxQGZKUpgdoQCMWB5GQ9BANCI9FIOPo9RidOPdGCI0kFQM0eVHwjpceMl1r_4VtiYO5NrrR3-C1NXiu_NoWDmuDlx_QOoVvwQNeqNwa59tN_qtO0VEJtVNnf3eInu8mT-OHYPZ4Px2PZkHFiEwCSEFAAirKOS9EKZI4ByCMxDGPs4QD4wXIlAqaQFYqwhQUghMhUp5ljAvgQ3Sx_VtBrVbalNa3kDfa5atRJBMmBRVJp4I9qlJGtVBbo0rdxT0f7vHdFKrR-d7CZa_QGa8-fQUb51Z9ePU_nC4XfXu9Y7ON00a5bjldrb3bVnb4D7_ilkg</recordid><startdate>20190201</startdate><enddate>20190201</enddate><creator>Zhao, Yun-Bin</creator><creator>Jiang, Houyuan</creator><creator>Luo, Zhi-Quan</creator><general>Institute for Operations Research and the Management Sciences</general><scope>ISR</scope></search><sort><creationdate>20190201</creationdate><title>Weak Stability of -Minimization Methods in Sparse Data Reconstruction</title><author>Zhao, Yun-Bin ; Jiang, Houyuan ; Luo, Zhi-Quan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-g2078-a9a4a8ae5c33d4f486caa0206636b83a23da791418abfe02ead4304493bb234a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Analysis</topic><topic>Data recovery</topic><topic>Mathematical optimization</topic><topic>Mathematical research</topic><topic>Methods</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhao, Yun-Bin</creatorcontrib><creatorcontrib>Jiang, Houyuan</creatorcontrib><creatorcontrib>Luo, Zhi-Quan</creatorcontrib><collection>Gale In Context: Science</collection><jtitle>Mathematics of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhao, Yun-Bin</au><au>Jiang, Houyuan</au><au>Luo, Zhi-Quan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Weak Stability of -Minimization Methods in Sparse Data Reconstruction</atitle><jtitle>Mathematics of operations research</jtitle><date>2019-02-01</date><risdate>2019</risdate><volume>44</volume><issue>1</issue><spage>173</spage><pages>173-</pages><issn>0364-765X</issn><eissn>1526-5471</eissn><abstract>As one of the most plausible convex optimization methods for sparse data reconstruction, [l.sub.1]-minimization plays a fundamental role in the development of sparse optimization theory. The stability of this method has been addressed in the literature under various assumptions such as the restricted isometry property, null space property, and mutual coherence. In this paper, we propose a unified means to develop the so-called weak stability theory for [l.sub.1]-minimization methods under the condition called the weak range space property of a transposed design matrix, which turns out to be a necessary and sufficient condition for the standard [l.sub.1]-minimization method to be weakly stable in sparse data reconstruction. The reconstruction error bounds established in this paper are measured by the so-called Robinson's constant. We also provide a unified weak stability result for standard [l.sub.1]-minimization under several existing compressed sensing matrix properties. In particular, the weak stability of this method under the constant-free range space property of the transposed design matrix is established, to our knowledge, for the first time in this paper. Different from the existing analysis, we utilize the classic Hoffman's lemma concerning the error bound of linear systems as well as Dudley's theorem concerning the polytope approximation of the unit ball to show that [l.sub.1]-minimization is robustly and weakly stable in recovering sparse data from inaccurate measurements.</abstract><pub>Institute for Operations Research and the Management Sciences</pub><doi>10.1287/moor.2017.0919</doi><tpages>23</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0364-765X |
| ispartof | Mathematics of operations research, 2019-02, Vol.44 (1), p.173 |
| issn | 0364-765X 1526-5471 |
| language | eng |
| recordid | cdi_gale_infotracmisc_A578274148 |
| source | Business Source Ultimate |
| subjects | Analysis Data recovery Mathematical optimization Mathematical research Methods |
| title | Weak Stability of -Minimization Methods in Sparse Data Reconstruction |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-23T03%3A25%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Weak%20Stability%20of%20-Minimization%20Methods%20in%20Sparse%20Data%20Reconstruction&rft.jtitle=Mathematics%20of%20operations%20research&rft.au=Zhao,%20Yun-Bin&rft.date=2019-02-01&rft.volume=44&rft.issue=1&rft.spage=173&rft.pages=173-&rft.issn=0364-765X&rft.eissn=1526-5471&rft_id=info:doi/10.1287/moor.2017.0919&rft_dat=%3Cgale%3EA578274148%3C/gale%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-g2078-a9a4a8ae5c33d4f486caa0206636b83a23da791418abfe02ead4304493bb234a3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_galeid=A578274148&rfr_iscdi=true |