A symmetric ADMM-type algorithm for robust tensor completion problems using a regularized SCAD-Schatten-p model with application in color image and video recovery
Zhechen Zhang , Sanyang Liu , Lixia Liu , Zhiping Lin
{"title":"A symmetric ADMM-type algorithm for robust tensor completion problems using a regularized SCAD-Schatten-p model with application in color image and video recovery","authors":"Zhechen Zhang , Sanyang Liu , Lixia Liu , Zhiping Lin","doi":"10.1016/j.cam.2025.116604","DOIUrl":null,"url":null,"abstract":"<div><div>In this work, we design an efficient method for tackling the robust tensor completion problem. Tensor nuclear norm (TNN) is a conventional approach to solve the robust tensor completion problem. However, TNN may yield suboptimal solutions because the tensor rank is non-convex. With this purpose, we introduce an innovative tensor rank approximation that combines the Schatten-p norm with the Smoothly Clipped Absolute Deviation function. Additionally, we incorporate the Total Variation technique into the model to preserve the local smoothing properties of the image. To address the resulting model, we formulate a symmetric Alternating Direction Method of Multipliers algorithm (ADMM). Under some mild conditions, we validate that the solution produced by the algorithm converges to the KKT point of the model. Comprehensive experiments indicate the excellent performance of the proposed approach.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"466 ","pages":"Article 116604"},"PeriodicalIF":2.1000,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725001190","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In this work, we design an efficient method for tackling the robust tensor completion problem. Tensor nuclear norm (TNN) is a conventional approach to solve the robust tensor completion problem. However, TNN may yield suboptimal solutions because the tensor rank is non-convex. With this purpose, we introduce an innovative tensor rank approximation that combines the Schatten-p norm with the Smoothly Clipped Absolute Deviation function. Additionally, we incorporate the Total Variation technique into the model to preserve the local smoothing properties of the image. To address the resulting model, we formulate a symmetric Alternating Direction Method of Multipliers algorithm (ADMM). Under some mild conditions, we validate that the solution produced by the algorithm converges to the KKT point of the model. Comprehensive experiments indicate the excellent performance of the proposed approach.
期刊介绍:
The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest.
The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.