{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:22:53Z","timestamp":1783095773849,"version":"3.54.6"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013772","name":"Harbin Normal University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013772","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117826","type":"journal-article","created":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T15:30:12Z","timestamp":1780155012000},"page":"117826","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Inexact proximal linearized algorithm for difference of convex composite functions"],"prefix":"10.1016","volume":"488","author":[{"given":"Shuai","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Kan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117826_bib0001","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","article-title":"Descent methods for composite nondifferentiable optimization problems","volume":"33","author":"Burke","year":"1985","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0002","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-015-0943-9","article-title":"A proximal method for composite minimization","volume":"158","author":"Lewis","year":"2016","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0003","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","article-title":"DC approximation approaches for sparse optimization","volume":"244","author":"Le Thi","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"10.1016\/j.cam.2026.117826_bib0004","doi-asserted-by":"crossref","first-page":"2283","DOI":"10.1016\/j.sigpro.2007.04.004","article-title":"Overview of total least-squares methods","volume":"87","author":"Markovsky","year":"2007","journal-title":"Signal Process."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0005","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s11075-009-9276-1","article-title":"Geometric computation of the numerical radius of a matrix","volume":"52","author":"Uhlig","year":"2009","journal-title":"Numer. Algorithms."},{"issue":"4","key":"10.1016\/j.cam.2026.117826_bib0006","doi-asserted-by":"crossref","first-page":"2494","DOI":"10.1137\/18M1171989","article-title":"Composite optimization by nonconvex majorization-minimization","volume":"11","author":"Geiping","year":"2018","journal-title":"SIAM J. Imaging Sci."},{"key":"10.1016\/j.cam.2026.117826_bib0007","series-title":"Trends in Mathematical Optimization: 4th French-German Conference on Optimization","first-page":"277","article-title":"Duality in DC (Difference of convex functions) optimization. Subgradient methods","author":"Tao","year":"1988"},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0008","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","article-title":"Convergence analysis of difference-of-convex algorithm with subanalytic data","volume":"179","author":"Le Thi","year":"2018","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0009","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/18M123339X","article-title":"The boosted difference of convex functions algorithm for nonsmooth functions","volume":"30","author":"Arag\u00f3n Artacho","year":"2020","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0010","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s10589-024-00578-4","article-title":"A boosted DC algorithm for non-differentiable DC components with non-monotone line search","volume":"88","author":"Ferreira","year":"2024","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0011","doi-asserted-by":"crossref","first-page":"1973","DOI":"10.1287\/moor.2020.0393","article-title":"Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems","volume":"49","author":"Phan","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117826_bib0012","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","article-title":"Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization","volume":"176","author":"Lu","year":"2019","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117826_bib0013","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.neunet.2020.08.024","article-title":"Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression","volume":"132","author":"Le Thi","year":"2020","journal-title":"Neural Netw."},{"issue":"4","key":"10.1016\/j.cam.2026.117826_bib0014","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1007\/s10898-021-01043-w","article-title":"Alternating DC algorithm for partial DC programming problems","volume":"82","author":"Pham Dinh","year":"2022","journal-title":"J. Glob. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117826_bib0015","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1287\/moor.2021.0258","article-title":"Minimizing compositions of differences-of-convex functions with smooth mappings","volume":"49","author":"Le Thi","year":"2024","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0016","first-page":"289","article-title":"Convex analysis approach to DC programming: theory, algorithms and applications","volume":"22","author":"Tao","year":"1997","journal-title":"Acta Math. Vietnam."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0017","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10898-023-01272-1","article-title":"Open issues and recent advances in DC programming and DCA","volume":"88","author":"Le Thi","year":"2024","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117826_bib0018","first-page":"451","article-title":"Proximal point algorithm for minimization of DC function","volume":"21","author":"Sun","year":"2003","journal-title":"J. delcComput. Math."},{"key":"10.1016\/j.cam.2026.117826_bib0019","first-page":"475","article-title":"On the convergence of an approximate proximal method for DC functions","volume":"24","author":"Moudafi","year":"2006","journal-title":"J. Comput. Math."},{"issue":"7","key":"10.1016\/j.cam.2026.117826_bib0020","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1007\/s11590-015-0969-1","article-title":"Global convergence of a proximal linearized algorithm for difference of convex functions","volume":"10","author":"Souza","year":"2016","journal-title":"Optim. Lett."},{"key":"10.1016\/j.cam.2026.117826_bib0021","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","article-title":"Efficiency of minimizing compositions of convex functions and smooth maps","volume":"178","author":"Drusvyatskiy","year":"2019","journal-title":"Math. Program."},{"issue":"8","key":"10.1016\/j.cam.2026.117826_bib0022","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","article-title":"A generalized proximal point algorithm for certain non-convex minimization problems","volume":"12","author":"Fukushima","year":"1981","journal-title":"Int. J. Syst. Sci."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0023","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-012-0600-5","article-title":"Composite proximal bundle method","volume":"140","author":"Sagastiz\u00e1bal","year":"2013","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0024","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/moor.2017.0889","article-title":"Error bounds, quadratic growth, and linear convergence of proximal methods","volume":"43","author":"Drusvyatskiy","year":"2018","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117826_bib0025","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1080\/10556788.2023.2269594","article-title":"Learning graph Laplacian with MCP","volume":"39","author":"Zhang","year":"2024","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117826_bib0026","unstructured":"T. Tao, R. Liu, S. Pan, An inexact LPA for DC composite optimization and application to matrix completions with outliers, (2023). arXiv: 2303.16822."},{"key":"10.1016\/j.cam.2026.117826_bib0027","series-title":"Variational Analysis","author":"Rockafellar","year":"1998"},{"key":"10.1016\/j.cam.2026.117826_bib0028","series-title":"First-Order Methods in Optimization","author":"Beck","year":"2017"},{"key":"10.1016\/j.cam.2026.117826_bib0029","series-title":"Implicit Functions and Solution Mappings","volume":"543","author":"Dontchev","year":"2009"},{"key":"10.1016\/j.cam.2026.117826_bib0030","series-title":"Optimization and Nonsmooth Analysis","author":"Clarke","year":"1990"},{"issue":"2","key":"10.1016\/j.cam.2026.117826_bib0031","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","article-title":"Clarke subgradients of stratifiable functions","volume":"18","author":"Bolte","year":"2007","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117826_bib0032","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10589-024-00560-0","article-title":"An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization","volume":"88","author":"Liu","year":"2024","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117826_bib0033","series-title":"Annales de l\u2019institut Fourier","first-page":"769","article-title":"On gradients of functions definable in o-minimal structures","volume":"48","author":"Kurdyka","year":"1998"},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0034","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","article-title":"Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods","volume":"137","author":"Attouch","year":"2013","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117826_bib0035","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","article-title":"On the convergence of the proximal algorithm for nonsmooth functions involving analytic features","volume":"116","author":"Attouch","year":"2009","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.cam.2026.117826_bib0036","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s11228-021-00591-3","article-title":"Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems","volume":"29","author":"Ye","year":"2021","journal-title":"Set-Valued Var. Anal."},{"key":"10.1016\/j.cam.2026.117826_bib0037","series-title":"Fundamentals of Convex Analysis","author":"Hiriart-Urruty","year":"2004"},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0038","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01585170","article-title":"Convergence of some algorithms for convex minimization","volume":"62","author":"Correa","year":"1993","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117826_bib0039","series-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"Facchinei","year":"2003"},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0040","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/s10915-021-01541-9","article-title":"An efficient Hessian based algorithm for singly linearly and box constrained least squares regression","volume":"88","author":"Lin","year":"2021","journal-title":"J. Sci. Comput."},{"issue":"5","key":"10.1016\/j.cam.2026.117826_bib0041","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1007\/s10208-017-9366-8","article-title":"Calculus of the exponent of Kurdyka\u2013\u0141ojasiewicz inequality and its applications to linear convergence of first-order methods","volume":"18","author":"Li","year":"2018","journal-title":"Found. Comput. Math."},{"issue":"2","key":"10.1016\/j.cam.2026.117826_bib0042","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","article-title":"Fast L1\u2013L2 minimization via a proximal operator","volume":"74","author":"Lou","year":"2018","journal-title":"J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117826_bib0043","series-title":"Convex Analysis and Global Optimization","author":"Tuy","year":"1998"},{"key":"10.1016\/j.cam.2026.117826_bib0044","series-title":"Perturbation Analysis of Optimization Problems","author":"Bonnans","year":"2013"},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0045","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","article-title":"A nonsmooth version of Newton\u2019s method","volume":"58","author":"Qi","year":"1993","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0046","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","article-title":"A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems","volume":"28","author":"Li","year":"2018","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117826_bib0047","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","article-title":"A Newton-CG augmented Lagrangian method for semidefinite programming","volume":"20","author":"Zhao","year":"2010","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.cam.2026.117826_bib0048","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01442169","article-title":"Generalized Hessian matrix and second-order optimality conditions for problems with C 1, 1 data","volume":"11","author":"Hiriart-Urruty","year":"1984","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/j.cam.2026.117826_bib0049","series-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"Ortega","year":"2000"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004681?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004681?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T15:47:49Z","timestamp":1783093669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":49,"alternative-id":["S0377042726004681"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117826","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inexact proximal linearized algorithm for difference of convex composite functions","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117826","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117826"}}