{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:45:47Z","timestamp":1759970747461,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T00:00:00Z","timestamp":1738108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>This paper presents the Parallel Primal-Dual (PPD3) algorithm, an innovative approach to solving optimization problems characterized by the minimization of the sum of three convex functions, including a Lipschitz continuous term. The proposed algorithm operates in a parallel framework, simultaneously updating primal and dual variables, and offers potential computational advantages. This parallelization can greatly accelerate computation, particularly when run on parallel computing platforms. By departing from traditional primal-dual methods that necessitate strict parameter constraints, the PPD3 algorithm removes reliance on the spectral norm of the linear operator, significantly reducing the computational burden associated with its evaluation. As the problem size grows, calculating the spectral norm, which is essential for many primal-dual methods, becomes progressively more expensive. In addition, adaptive step sizes are computed to accelerate the convergence process. In contrast to most primal-dual approaches that employ a fixed step size constrained by a global upper limit throughout all iterations, the adaptive step size is typically greater and may result in faster convergence. An O(1\/k) ergodic convergence rate is proved theoretically. Applications in Fused LASSO and image inpainting demonstrate the method\u2019s efficiency in computation time and convergence rate compared to state-of-the-art algorithms.<\/jats:p>","DOI":"10.3390\/axioms14020104","type":"journal-article","created":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T10:36:28Z","timestamp":1738146988000},"page":"104","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Primal-Dual Method with Linearization for Structured Convex Optimization"],"prefix":"10.3390","volume":"14","author":[{"given":"Xiayang","family":"Zhang","sequence":"first","affiliation":[{"name":"Nanjing Institute of Technology, Nanjing 211167, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiye","family":"Tang","sequence":"additional","affiliation":[{"name":"Nanjing Institute of Technology, Nanjing 211167, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayue","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing Institute of Technology, Nanjing 211167, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing Institute of Technology, Nanjing 211167, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangqun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanjing Institute of Technology, Nanjing 211167, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,1,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","article-title":"Regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","article-title":"Matrix Completion With Noise","volume":"98","author":"Candes","year":"2010","journal-title":"Proc. IEEE"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","author":"Cortes","year":"1995","journal-title":"Mach. Learn."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/S0363012998338806","article-title":"A modified forward-backward splitting method for maximal monotone mappings","volume":"38","author":"Tseng","year":"2000","journal-title":"SIAM J. Control Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","article-title":"Ergodic convergence to a zero of the sum of monotone operators in Hilbert space","volume":"72","author":"Passty","year":"1979","journal-title":"J. Math. Anal. Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","article-title":"Splitting algorithms for the sum of two nonlinear operators","volume":"16","author":"Lions","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_7","unstructured":"Zhu, M., and Chan, T.F. (2008). An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA. CAM Report 08-34."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","article-title":"A first-order primal-dual algorithm for convex problems with applications to imaging","volume":"40","author":"Chambolle","year":"2011","journal-title":"Math. Imaging Vis."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/100814494","article-title":"Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective","volume":"5","author":"He","year":"2012","journal-title":"SIAM J. Imaging Sci."},{"key":"ref_10","unstructured":"Goldstein, T., Li, M., Yuan, X., Esser, E., and Baraniuk, R. (2015). Adaptive primal-dual hybrid gradient methods for saddle-point problems. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1137\/13094671X","article-title":"Primal-dual decomposition by operator splitting and applications to image deblurring","volume":"7","author":"Vandenberghe","year":"2014","journal-title":"SIAM J. Imaging Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.4208\/nmtma.2018.m1621","article-title":"Adaptive parallel primal-dual method for saddle point problems","volume":"11","author":"Zhang","year":"2018","journal-title":"Numer. Math. Theory, Method Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","article-title":"A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms","volume":"158","author":"Condat","year":"2013","journal-title":"J. Optim. Theory Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s10444-011-9254-8","article-title":"A splitting algorithm for dual monotone inclusions involving cocoercive operators","volume":"38","year":"2013","journal-title":"Adv. Comput. Math."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Latafat, P., and Patrinos, P. (2016). Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators. arXiv.","DOI":"10.1007\/s10589-017-9909-6"},{"key":"ref_16","first-page":"1","article-title":"A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions","volume":"54","author":"Chen","year":"2016","journal-title":"Fixed Point Theory Appl."},{"key":"ref_17","unstructured":"Yan, M. (2025, January 26). A Primal-Dual Three-Operator Splitting Scheme. Available online: https:\/\/optimization-online.org\/?p=14319."},{"key":"ref_18","unstructured":"Davis, D., and Yin, W. (2014). Convergence rate analysis of several splitting schemes. arXiv."},{"key":"ref_19","unstructured":"Xu, C.Y.H., and Yang, J. (2024). A Modified Primal-Dual algorithm for Structured Convex Optimization with a Lipschitzian Term. J. Oper. Res. China, 1\u201321."},{"key":"ref_20","unstructured":"He, B., and Yuan, X. (2021). Balanced augmented Lagrangian method for convex programming. arXiv."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/s10915-024-02537-x","article-title":"On the improved Conditions for Some Primal-Dual Algorithms","volume":"99","author":"Yan","year":"2024","journal-title":"J. Sci. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via admm","volume":"3","author":"Boyd","year":"2010","journal-title":"Found. Trends Machine Learn."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/B:COAP.0000013058.17185.90","article-title":"Comparison of two kinds of prediction-correction methods for monotone variational inequalities","volume":"27","author":"He","year":"2004","journal-title":"Comput. Optim. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Facchinei, F., and Pang, J.-S. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems, Springer.","DOI":"10.1007\/b97544"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","article-title":"On the O(1\/n) convergence rate of the Douglas-Rachford alternating direction method","volume":"50","author":"He","year":"2012","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/2\/104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T10:38:24Z","timestamp":1759919904000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/14\/2\/104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,29]]},"references-count":25,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["axioms14020104"],"URL":"https:\/\/doi.org\/10.3390\/axioms14020104","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2025,1,29]]}}}