{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:07:21Z","timestamp":1778821641485,"version":"3.51.4"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFA1011100"],"award-info":[{"award-number":["2023YFA1011100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"Higher Education Discipline Innovation Project","doi-asserted-by":"publisher","award":["B16002"],"award-info":[{"award-number":["B16002"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571316"],"award-info":[{"award-number":["12571316"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12131004"],"award-info":[{"award-number":["12131004"]}],"id":[{"id":"10.13039\/501100001809","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,11]]},"DOI":"10.1016\/j.cam.2026.117700","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T07:35:05Z","timestamp":1775633705000},"page":"117700","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An inexact Newton augmented Lagrangian method for classification involving 0\/1 loss"],"prefix":"10.1016","volume":"486","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-8467","authenticated-orcid":false,"given":"Penghe","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houduo","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.cam.2026.117700_bib0001","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1137\/100806126","article-title":"Learning kernel-based halfspaces with the 0\u20131 loss","volume":"40","author":"Shalev-Shwartz","year":"2011","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0002","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1214\/08-AOS595","article-title":"On surrogate loss functions and f-divergences","volume":"37","author":"Nguyen","year":"2009","journal-title":"Ann. Stat."},{"issue":"3","key":"10.1016\/j.cam.2026.117700_bib0003","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1022627411411","article-title":"Support-vector networks","volume":"20","author":"Cortes","year":"1995","journal-title":"Mach. Learn."},{"issue":"8","key":"10.1016\/j.cam.2026.117700_bib0004","doi-asserted-by":"crossref","first-page":"1819","DOI":"10.1109\/TKDE.2013.39","article-title":"A review on multi-label learning algorithms","volume":"26","author":"Zhang","year":"2013","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10.1016\/j.cam.2026.117700_bib0005","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/S0022-0000(03)00038-2","article-title":"On the difficulty of approximately maximizing agreements","volume":"66","author":"Ben-David","year":"2003","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cam.2026.117700_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-024-02090-3","article-title":"Composite optimization with indicator functions: stationary duality and a semismooth Newton method","author":"Zhang","year":"2025","journal-title":"Math. Program"},{"issue":"1\u20132","key":"10.1016\/j.cam.2026.117700_bib0007","first-page":"5","article-title":"Augmented Lagrangian methods under the constant positive linear dependence constraint qualification","volume":"111","author":"Andreani","year":"2008","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117700_bib0008","article-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"Bertsekas","year":"1996"},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0009","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-018-1300-6","article-title":"On the r-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming","volume":"178","author":"Cui","year":"2019","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0010","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1093\/imanum\/draa021","article-title":"On the complexity of an augmented Lagrangian method for nonconvex optimization","volume":"41","author":"Grapiglia","year":"2021","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0011","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/moor.2018.0939","article-title":"On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming","volume":"44","author":"Liu","year":"2019","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117700_bib0012","first-page":"283","article-title":"A method for nonlinear constraints in minimization problems","author":"Powell","year":"1969"},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0013","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","article-title":"Augmented Lagrangians and applications of the proximal point algorithm in convex programming","volume":"1","author":"Rockafellar","year":"1976","journal-title":"Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.cam.2026.117700_bib0014","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1287\/moor.2017.0900","article-title":"Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence","volume":"43","author":"Bolte","year":"2018","journal-title":"Math. Oper. Res."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0015","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10915-022-01815-w","article-title":"Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints","volume":"91","author":"Zeng","year":"2021","journal-title":"J. Sci. Comput."},{"issue":"4","key":"10.1016\/j.cam.2026.117700_bib0016","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","article-title":"Global convergence of splitting methods for nonconvex composite optimization","volume":"25","author":"Li","year":"2015","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0017","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1137\/18M1190689","article-title":"A proximal minimization algorithm for structured nonconvex and nonsmooth problems","volume":"29","author":"Bo\u0163","year":"2019","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117700_bib0018","doi-asserted-by":"crossref","first-page":"2602","DOI":"10.1287\/moor.2021.0320","article-title":"Zero-one composite optimization: Lyapunov exact penalty and a globally convergent inexact augmented Lagrangian method","volume":"49","author":"Zhang","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117700_bib0019","article-title":"Numerical optimization","author":"Nocedal","year":"2006"},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0020","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0364-4","article-title":"Local behavior of an iterative framework for generalized equations with nonisolated solutions","volume":"94","author":"Fischer","year":"2002","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0021","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-010-0413-3","article-title":"Stabilized SQP revisited","volume":"133","author":"Izmailov","year":"2012","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117700_bib0022","series-title":"IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","first-page":"5760","article-title":"An efficient augmented Lagrangian-based method for linear equality-constrained Lasso","author":"Deng","year":"2020"},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0023","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":"3","key":"10.1016\/j.cam.2026.117700_bib0024","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1137\/19M1251795","article-title":"An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for linear programming","volume":"30","author":"Li","year":"2020","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117700_bib0025","first-page":"1","article-title":"An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems","volume":"14","author":"Lin","year":"2021","journal-title":"Math. Program. Comput."},{"issue":"3","key":"10.1016\/j.cam.2026.117700_bib0026","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1137\/120869778","article-title":"Sparsity constrained nonlinear optimization: optimality conditions and algorithms","volume":"23","author":"Beck","year":"2013","journal-title":"SIAM J. Optim."},{"issue":"6","key":"10.1016\/j.cam.2026.117700_bib0027","doi-asserted-by":"crossref","first-page":"2370","DOI":"10.1109\/TSP.2007.916124","article-title":"Gradient pursuits","volume":"56","author":"Blumensath","year":"2008","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"10.1016\/j.cam.2026.117700_bib0028","first-page":"1","article-title":"Global and quadratic convergence of Newton hard-thresholding pursuit","volume":"22","author":"Zhou","year":"2021","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"10.1016\/j.cam.2026.117700_bib0029","doi-asserted-by":"crossref","first-page":"3184","DOI":"10.1137\/21M1409445","article-title":"Quadratic convergence of smoothing Newton\u2019s method for 0\/1 loss optimization","volume":"31","author":"Zhou","year":"2021","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117700_bib0030","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","article-title":"First-Order Methods in Optimization","author":"Beck","year":"2017"},{"key":"10.1016\/j.cam.2026.117700_bib0031","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","article-title":"Variational Analysis","author":"Rockafellar","year":"1998"},{"key":"10.1016\/j.cam.2026.117700_bib0032","series-title":"Accelerated optimization for machine learning","author":"Lin","year":"2020"},{"issue":"3","key":"10.1016\/j.cam.2026.117700_bib0033","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1137\/16M1080240","article-title":"Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms","volume":"28","author":"Themelis","year":"2018","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117700_bib0034","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-018-1277-1","article-title":"Optimization problems involving group sparsity terms","volume":"178","author":"Beck","year":"2019","journal-title":"Math. Program"},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0035","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s101070050047","article-title":"A QP-free constrained Newton-type method for variational inequality problems","volume":"85","author":"Kanzow","year":"1999","journal-title":"Math. Program."},{"issue":"6","key":"10.1016\/j.cam.2026.117700_bib0036","doi-asserted-by":"crossref","first-page":"3312","DOI":"10.1137\/090776664","article-title":"Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization","volume":"20","author":"Fern\u00e1ndez","year":"2010","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117700_bib0037","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10107-008-0255-4","article-title":"Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems","volume":"125","author":"Fern\u00e1ndez","year":"2010","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cam.2026.117700_bib0038","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/moor.2019.1008","article-title":"The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates","volume":"45","author":"Bo\u0163","year":"2020","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.cam.2026.117700_bib0039","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: a library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"10.1016\/j.cam.2026.117700_bib0040","series-title":"LS-SVMLab: a matlab\/c toolbox for least squares support vector machines","volume":"142","author":"Pelckmans","year":"2002"},{"key":"10.1016\/j.cam.2026.117700_bib0041","series-title":"Proceedings of the 23rd International Conference on Machine Learning","first-page":"201","article-title":"Trading convexity for scalability","author":"Collobert","year":"2006"},{"issue":"1","key":"10.1016\/j.cam.2026.117700_bib0042","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-015-0875-4","article-title":"A second-order method for strongly convex \u21131-regularization problems","volume":"156","author":"Fountoulakis","year":"2016","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117700_bib0043","first-page":"681","article-title":"A kernel method for multi-labelled classification","volume":"14","author":"Elisseeff","year":"2001","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"7","key":"10.1016\/j.cam.2026.117700_bib0044","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1109\/TKDE.2010.164","article-title":"Random k-labelsets for multilabel classification","volume":"23","author":"Tsoumakas","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.cam.2026.117700_bib0045","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.patcog.2015.10.008","article-title":"MLTSVM: a novel twin support vector machine to multi-label learning","volume":"52","author":"Chen","year":"2016","journal-title":"Pattern Recognit."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726003420?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726003420?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:13:26Z","timestamp":1778818406000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726003420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":45,"alternative-id":["S0377042726003420"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117700","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An inexact Newton augmented Lagrangian method for classification involving 0\/1 loss","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.117700","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"117700"}}