{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T22:02:59Z","timestamp":1772056979976,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Commission through HORIZON SNS JU DESIRE6G","award":["G.A. 101096466"],"award-info":[{"award-number":["G.A. 101096466"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tsp.2026.3656332","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T21:12:37Z","timestamp":1769029957000},"page":"572-588","source":"Crossref","is-referenced-by-count":1,"title":["On the Characteristics of the Conjugate Function Enabling Effective Dual Decomposition Methods"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0295-0515","authenticated-orcid":false,"given":"Hansi","family":"Abeynanda","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0623-0208","authenticated-orcid":false,"given":"Chathuranga","family":"Weeraddana","sequence":"additional","affiliation":[{"name":"Centre for Wireless Communications, University of Oulu, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9810-3478","authenticated-orcid":false,"given":"Carlo","family":"Fischione","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science and the Digital Futures, KTH Royal Institute of Technology, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2219061"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981204"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105131"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511804458"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/9781638280071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/9781601984616"},{"key":"ref9","article-title":"Balanced augmented Lagrangian method for convex programming","author":"He","year":"2021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-024-02518-0"},{"key":"ref11","article-title":"Semismooth newton methods and applications, Dept. of Math., Humboldt-Univ. of Berlin","author":"Hinterm\u00fcller","year":"2010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref13","volume-title":"Introduction to Optimization.","author":"Polyak","year":"1987"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386306"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804458.003"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1214959"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403428208"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1673388"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3237392"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636036"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3014095"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01073924"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01073933"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584346"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-018-1372-8"},{"key":"ref28","article-title":"A linearly convergent method for non-smooth non-convex optimization on the Grassmannian with applications to robust subspace and dictionary learning,\u201d","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Zhu","year":"2019"},{"key":"ref29","article-title":"A universally optimal multistage accelerated stochastic gradient method","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Aybat","year":"2019"},{"key":"ref30","first-page":"14226","article-title":"On the convergence of step decay step-size for stochastic optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"34","author":"Wang","year":"2021"},{"key":"ref31","article-title":"Universal stagewise learning for non-convex problems with convergence on averaged solutions","author":"Chen","year":"2019"},{"key":"ref32","article-title":"ImageNet classification with deep convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"25","author":"Krizhevsky","year":"2012"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref34","article-title":"The step decay schedule: A near optimal, geometrically decaying learning rate procedure for least squares","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Ge","year":"2019"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90061-5"},{"key":"ref36","article-title":"Revisiting the Polyak step size","author":"Hazan","year":"2022"},{"key":"ref37","first-page":"1306","article-title":"Stochastic Polyak step-size for SGD: An adaptive learning rate for fast convergence","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Loizou","year":"2021"},{"key":"ref38","article-title":"Generalized Polyak step size for first order optimization with momentum","author":"Wang","year":"2023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/22.1.1"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.4208\/jcm.1911-m2019-0171"},{"key":"ref42","first-page":"6702","article-title":"Adaptive gradient descent without descent","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","volume":"119","author":"Malitsky","year":"2020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3031073"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3056915"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294614"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3213608"},{"key":"ref47","article-title":"\u201cNotes on decomposition methods,\u201d","author":"Boyd","year":"2007"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbad236"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(81)90096-5"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/tsp.2026.3656332"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-020-05929-w"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107279667"},{"key":"ref55","article-title":"\u201cSubgradients,\u201d","author":"Boyd","year":"2022"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3239799"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2011.03.003"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/78.533710"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2008.060497"},{"key":"ref62","volume-title":"Fundamentals of Statistical Signal Processing: Estimation Theory.","author":"Kay","year":"1993"},{"key":"ref63","article-title":"Real estate valuation","author":"Yeh","year":"2018"},{"key":"ref64","article-title":"Year prediction MSD","author":"Bertin-Mahieux","year":"2011"},{"key":"ref65","volume-title":"Deep Learning","volume":"1","author":"Goodfellow","year":"2016"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/11345506\/11359597.pdf?arnumber=11359597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:59:05Z","timestamp":1772053145000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tsp.2026.3656332","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}