{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:50:43Z","timestamp":1760143843485,"version":"build-2065373602"},"reference-count":39,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T00:00:00Z","timestamp":1709596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["12101195","12131004","12371300","61972133","12071112","20ZX001"],"award-info":[{"award-number":["12101195","12131004","12371300","61972133","12071112","20ZX001"]}]},{"name":"Basic research projects for key scientific research projects in Henan Projects of China","award":["12101195","12131004","12371300","61972133","12071112","20ZX001"],"award-info":[{"award-number":["12101195","12131004","12371300","61972133","12071112","20ZX001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The matrix nuclear norm minimization problem has been extensively researched in recent years due to its widespread applications in control design, signal and image restoration, machine learning, big data problems, and more. One popular model is nuclear norm minimization with the l2-norm fidelity term, but it is only effective for those problems with Gaussian noise. A nuclear norm minimization problem with the l1-norm fidelity term has been studied in this paper, which can deal with the problems with not only non-Gaussian noise but also Gaussian noise or their mixture. Moreover, it also keeps the efficiency for the noiseless case. Given the nonsmooth proposed model, we transform it into a separated form by introducing an auxiliary variable and solve it by the semi-proximal alternating direction method of multipliers (sPADMM). Furthermore, we first attempt to solve its dual problem by sPADMM. Then, the convergence guarantees for the aforementioned algorithms are given. Finally, some numerical studies are dedicated to show the robustness of the proposed model and the effectiveness of the presented algorithms.<\/jats:p>","DOI":"10.3390\/sym16030303","type":"journal-article","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T03:03:20Z","timestamp":1709607800000},"page":"303","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semi-Proximal ADMM for Primal and Dual Robust Low-Rank Matrix Restoration from Corrupted Observations"],"prefix":"10.3390","volume":"16","author":[{"given":"Weiwei","family":"Ding","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China"}]},{"given":"Youlin","family":"Shang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China"}]},{"given":"Zhengfen","family":"Jin","sequence":"additional","affiliation":[{"name":"LMIB of the Ministry of Education, School of Mathematical Sciences, Beihang University, Beijing 100191, China"},{"name":"School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China"}]},{"given":"Yibao","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,3,5]]},"reference":[{"key":"ref_1","unstructured":"Srebro, N. (2004). Learning with Matrix Factorizations. [Ph.D. Thesis, MIT Computer Science & Artificial Intelligence Laboratory]."},{"key":"ref_2","unstructured":"Mohan, K., and Fazel, M. (July, January 30). Reweighted nuclear norm minimization with application to system identification. Proceedings of the American Control Conference (ACC), Baltimore, MD, USA."},{"key":"ref_3","first-page":"11","article-title":"Robust principal component analysis?","volume":"58","author":"Li","year":"2011","journal-title":"J. ACM (JACM)"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3481","DOI":"10.1214\/17-AOS1666","article-title":"Robust low-rank matrix estimation","volume":"46","author":"Elsener","year":"2018","journal-title":"Ann. Stat."},{"key":"ref_5","unstructured":"Fazel, M., Hindi, H., and Boyd, S. (July, January 30). Rank minimization and applications in system theory. Proceedings of the American Control Conference, Boston, MA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"051009","DOI":"10.1115\/1.4062793","article-title":"Design and validation of a non-parasitic 2R1T parallel hand-held prostate biopsy robot with remote center of motion","volume":"16","author":"Jiang","year":"2024","journal-title":"J. Mech. Robot."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","article-title":"Fixed point and Bregman iterative methods for matrix rank minimization","volume":"128","author":"Ma","year":"2011","journal-title":"Math. Program."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","article-title":"Exact matrix completion via convex optimization","volume":"9","author":"Recht","year":"2009","journal-title":"Found. Comput. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Tao","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","article-title":"Matrix completion from a few entries","volume":"56","author":"Keshavan","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","article-title":"Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones","volume":"11","author":"Sturm","year":"1999","journal-title":"Optim. Methods Softw."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","article-title":"Solving semidefinite-quadratic-linear programs using SDPT3","volume":"95","author":"Toh","year":"2003","journal-title":"Math. Program."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM J. Optim."},{"key":"ref_14","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"Toh","year":"2010","journal-title":"Pac. J. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10107-010-0437-8","article-title":"An implementable proximal point algorithmic framework for nuclear norm minimization","volume":"133","author":"Liu","year":"2012","journal-title":"Math. Program."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1002\/nla.783","article-title":"An alternating direction method for linear-constrained matrix nuclear norm minimization","volume":"19","author":"Xiao","year":"2012","journal-title":"Numer. Linear Algebra Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","article-title":"Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization","volume":"82","author":"Yang","year":"2013","journal-title":"Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1007\/s10851-018-0808-y","article-title":"Symmetric Gauss\u2013Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem","volume":"60","author":"Ding","year":"2018","journal-title":"J. Math. Imaging Vis."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10444-011-9243-y","article-title":"Proximity algorithms for the L1\/TV image denoising model","volume":"38","author":"Micchelli","year":"2013","journal-title":"Adv. Comput. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/78.564179","article-title":"A property of the minimum vectors of a regularizing functional defined by means of the absolute norm","volume":"45","author":"Alliney","year":"1997","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000055","article-title":"Generalized low rank models","volume":"9","author":"Udell","year":"2016","journal-title":"Found. Trends\u00ae Mach. Learn."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"4767","DOI":"10.1109\/TSP.2016.2572049","article-title":"Efficient algorithms on robust low-rank matrix completion against outliers","volume":"64","author":"Zhao","year":"2016","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1109\/LSP.2017.2685518","article-title":"Robust matrix completion via alternating projection","volume":"24","author":"Jiang","year":"2017","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_24","unstructured":"Guennec, A., Aujol, J., and Traonmilin, Y. (2023, March 17). Adaptive Parameter Selection for Gradient-Sparse + Low Patch-Rank Recovery: Application to Image Decomposition. HAL Id: Hal-04207313. 2024. Available online: https:\/\/hal.science\/hal-04207313\/document."},{"key":"ref_25","unstructured":"Liang, W. (2020). Alternating Direction Method of Multipliers for Robust Low Rank Matrix Completion. [Ph.D. Thesis, Beijing Jiaotong University]."},{"key":"ref_26","first-page":"5404","article-title":"Matrix completion with noisy entries and outliers","volume":"18","author":"Wong","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/83.503916","article-title":"A new efficient approach for the removal of impulse noise from highly corrupted images","volume":"5","author":"Abreu","year":"1996","journal-title":"IEEE Trans. Image Process."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ji, H., Liu, C., Shen, Z., and Xu, Y. (2010, January 13\u201318). Robust video denoising using low rank matrix completion. Proceedings of the Computer Vision and Pattern Recognition (CVPR), San Francisco, CA, USA.","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"695","DOI":"10.3934\/eect.2019034","article-title":"A penalty decomposition method for nuclear norm minimization with l1 norm fidelity term","volume":"8","author":"Wang","year":"2019","journal-title":"Evol. Equ. Control Theory"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2014","journal-title":"Found. Trends\u00ae Optim."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10589-012-9475-x","article-title":"Primal and dual alternating direction algorithms for l1-l1-norm minimization problems in compressive sensing","volume":"54","author":"Xiao","year":"2013","journal-title":"Comput. Optim. Appl."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s12532-014-0069-8","article-title":"A partial proximal point algorithm for nuclear norm regularized matrix least squares problems","volume":"6","author":"Jiang","year":"2014","journal-title":"Math. Program. Comput."},{"key":"ref_34","first-page":"41","article-title":"Sur l\u2019approximation, par\u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e9mes de Dirichlet non lin\u00e9aires","volume":"9","author":"Glowinski","year":"1975","journal-title":"ESAIM Math. Model. Numer.-Anal.-Mod\u00e9l. Math. Anal. Num\u00e9r."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","article-title":"A dual algorithm for the solution of nonlinear variational problems via finite element approximation","volume":"2","author":"Gabay","year":"1976","journal-title":"Comput. Math. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/10556789408805578","article-title":"Some Saddle-function splitting methods for convex programming","volume":"4","author":"Eckstein","year":"1994","journal-title":"Optim. Methods Softw."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","article-title":"Hankel matrix rank minimization with applications to system identification and realization","volume":"34","author":"Fazel","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"4859","DOI":"10.1016\/j.apm.2015.03.054","article-title":"A Penalty Decomposition Method for Rank Minimization Problem with Affine Constraints","volume":"39","author":"Jin","year":"2015","journal-title":"Appl. Math. Model."},{"key":"ref_39","unstructured":"Larsen, R.M. (2004, March 17). PROPACK-Software for Large and Sparse SVD Calculations. Available online: http:\/\/sun.stanford.edu\/~rmunk\/PROPACK\/."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/3\/303\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:09:13Z","timestamp":1760105353000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/3\/303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,5]]},"references-count":39,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["sym16030303"],"URL":"https:\/\/doi.org\/10.3390\/sym16030303","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2024,3,5]]}}}