{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:19:53Z","timestamp":1753881593204,"version":"3.41.2"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T00:00:00Z","timestamp":1626307200000},"content-version":"vor","delay-in-days":195,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2020J01843"],"award-info":[{"award-number":["2020J01843"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>The penalty decomposition method is an effective and versatile method for sparse optimization and has been successfully applied to solve compressed sensing, sparse logistic regression, sparse inverse covariance selection, low rank minimization, image restoration, and so on. With increase in the penalty parameters, a sequence of penalty subproblems required being solved by the penalty decomposition method may be time consuming. In this paper, an acceleration of the penalty decomposition method is proposed for the sparse optimization problem. For each penalty parameter, this method just finds some inexact solutions to those subproblems. Computational experiments on a number of test instances demonstrate the effectiveness and efficiency of the proposed method in accurately generating sparse and redundant representations of one\u2010dimensional random signals.<\/jats:p>","DOI":"10.1155\/2021\/9943519","type":"journal-article","created":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T22:05:06Z","timestamp":1626386706000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Inexact Penalty Decomposition Method for Sparse Optimization"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2179-0027","authenticated-orcid":false,"given":"Zhengshan","family":"Dong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1643-6859","authenticated-orcid":false,"given":"Geng","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1645-1485","authenticated-orcid":false,"given":"Niandong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,7,15]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/lsp.2007.898300"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2012.2214051"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2012-02631-7"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2010.2055862"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2013.65"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105956"},{"key":"e_1_2_9_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539792240406"},{"key":"e_1_2_9_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/78.258082"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/bf02678430"},{"key":"e_1_2_9_11_2","unstructured":"FangH. FanZ. SunY. andFriedlanderM. Greed meets sparsity: Understanding and improving greedy coordinate descent for sparse optimization Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics June 2020 Palermo Italy 434\u2013444."},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2007.910281"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/050626090"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/090777761"},{"key":"e_1_2_9_17_2","first-page":"733","article-title":"Homotopy continuation for sparse signal representation","volume":"5","author":"Malioutov D. M.","year":"2005","journal-title":"IEEE International Conference on Acoustics, Speech, and Signal Processing"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2009.2016892"},{"key":"e_1_2_9_19_2","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000067"},{"key":"e_1_2_9_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/070698920"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/110840364"},{"key":"e_1_2_9_22_2","doi-asserted-by":"publisher","DOI":"10.1137\/100808071"},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"YuanG. ShenL. andZhengW. A block decomposition algorithm for sparse optimization KDD\u201920: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining July 2020 CA USA 275\u2013285 https:\/\/doi.org\/10.1145\/3394486.3403070.","DOI":"10.1145\/3394486.3403070"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0714-4"},{"key":"e_1_2_9_27_2","doi-asserted-by":"publisher","DOI":"10.1137\/11085476x"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/jstsp.2010.2042411"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.09.017"},{"key":"e_1_2_9_30_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2014.936438"},{"key":"e_1_2_9_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/msp.2007.4286571"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/9943519.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2021\/9943519.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/9943519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T12:13:47Z","timestamp":1722946427000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/9943519"}},"subtitle":[],"editor":[{"given":"Henry Man Fai","family":"Leung","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/9943519"],"URL":"https:\/\/doi.org\/10.1155\/2021\/9943519","archive":["Portico"],"relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"type":"print","value":"1687-5265"},{"type":"electronic","value":"1687-5273"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-03-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"9943519"}}