{"title":"AN ALTERNATING DIRECTION METHOD OF MULTIPLIERS WITH THE CONDITIONAL GRADIENT TOTAL VARIATION METHOD FOR LINEAR INVERSE PROBLEMS","authors":"A. Bentbib, A. Bouhamidi, K. Kreit","doi":"10.32523/2306-6172-2023-11-2-4-39","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we study the ill-posed problem using total variation regularization. To solve such a problem, we use an alternating direction method of multipliers to split our problem into two sub-problems. The novelty of our paper is in the use of the conditional gradient total variation method (CGTV) we have recently introduced. The second split- ting sub-problem is solved by transforming the obtained optimization problem to a general Sylvester matrix equation and then an orthogonal projection method is used to solve the obtained matrix equation. We give proof of the convergence of this method. Some numerical examples and applications to image restoration are given to illustrate the effectiveness of the proposed method.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32523/2306-6172-2023-11-2-4-39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract In this paper, we study the ill-posed problem using total variation regularization. To solve such a problem, we use an alternating direction method of multipliers to split our problem into two sub-problems. The novelty of our paper is in the use of the conditional gradient total variation method (CGTV) we have recently introduced. The second split- ting sub-problem is solved by transforming the obtained optimization problem to a general Sylvester matrix equation and then an orthogonal projection method is used to solve the obtained matrix equation. We give proof of the convergence of this method. Some numerical examples and applications to image restoration are given to illustrate the effectiveness of the proposed method.