{"title":"基于FISTA的ADMM -l_{1}$ -范数最小化解","authors":"T. Oishi, Y. Kuroki","doi":"10.1109/ICIIBMS.2018.8549934","DOIUrl":null,"url":null,"abstract":"This paper discusses compressed sensing which reconstructs original sparse signal from observed data. Our approach formulates the weighted sum of $l_{1}$ -norm error and $l_{1}$ -norm regularization terms, and applies Alternating Direction Method of Multipliers (ADMM) to solve it. Many works employ ADMM for the $l_{1}-l_{1}$ -norm minimization problems, where ADMM obtains solutions in an iterative fashion for the problems formed as an augmented Lagrangian. The ADMM process is divided into three steps: an error minimization, a coefficient-norm minimization, and a dual variable update of an augmented Lagrangian. However, the coefficient-minimization step is not clear and replaced with an approximation. Our contribution is to adopt the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) for the minimization step and achieves faster implementation than a conventional method.","PeriodicalId":430326,"journal":{"name":"2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An $l_{1}-l_{1}$ -Norm Minimization Solution Using ADMM with FISTA\",\"authors\":\"T. Oishi, Y. Kuroki\",\"doi\":\"10.1109/ICIIBMS.2018.8549934\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses compressed sensing which reconstructs original sparse signal from observed data. Our approach formulates the weighted sum of $l_{1}$ -norm error and $l_{1}$ -norm regularization terms, and applies Alternating Direction Method of Multipliers (ADMM) to solve it. Many works employ ADMM for the $l_{1}-l_{1}$ -norm minimization problems, where ADMM obtains solutions in an iterative fashion for the problems formed as an augmented Lagrangian. The ADMM process is divided into three steps: an error minimization, a coefficient-norm minimization, and a dual variable update of an augmented Lagrangian. However, the coefficient-minimization step is not clear and replaced with an approximation. Our contribution is to adopt the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) for the minimization step and achieves faster implementation than a conventional method.\",\"PeriodicalId\":430326,\"journal\":{\"name\":\"2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIIBMS.2018.8549934\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIIBMS.2018.8549934","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An $l_{1}-l_{1}$ -Norm Minimization Solution Using ADMM with FISTA
This paper discusses compressed sensing which reconstructs original sparse signal from observed data. Our approach formulates the weighted sum of $l_{1}$ -norm error and $l_{1}$ -norm regularization terms, and applies Alternating Direction Method of Multipliers (ADMM) to solve it. Many works employ ADMM for the $l_{1}-l_{1}$ -norm minimization problems, where ADMM obtains solutions in an iterative fashion for the problems formed as an augmented Lagrangian. The ADMM process is divided into three steps: an error minimization, a coefficient-norm minimization, and a dual variable update of an augmented Lagrangian. However, the coefficient-minimization step is not clear and replaced with an approximation. Our contribution is to adopt the Fast Iterative Shrinkage-Thresholding Algorithm (FISTA) for the minimization step and achieves faster implementation than a conventional method.