{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:32Z","timestamp":1772120132202,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00323-x","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T09:02:58Z","timestamp":1714381378000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Convergence of Inexact Alternate Minimization in Problems with $$\\ell _0$$ Penalties"],"prefix":"10.1007","volume":"5","author":[{"given":"Matteo","family":"Lapucci","sequence":"first","affiliation":[]},{"given":"Alessio","family":"Sortino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"issue":"3","key":"323_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath T, Davies ME (2009) Iterative hard thresholding for compressed sensing. Appl Comput Harmon Anal 27(3):265\u2013274","journal-title":"Appl Comput Harmon Anal"},{"key":"323_CR2","doi-asserted-by":"crossref","unstructured":"Foucart S, Rauhut H (2013) An invitation to compressive sensing. In: A Mathematical Introduction to Compressive Sensing. Springer, pp 1\u201339","DOI":"10.1007\/978-0-8176-4948-7_1"},{"key":"323_CR3","doi-asserted-by":"crossref","unstructured":"Bach F, Jenatton R, Mairal J, Obozinski G (2011) Optimization with sparsity-inducing penalties. Preprint at http:\/\/arxiv.org\/abs\/1108.0775","DOI":"10.1561\/9781601985118"},{"key":"323_CR4","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston J, Elisseeff A, Sch\u00f6lkopf B, Tipping M (2003) Use of the zero norm with linear models and kernel methods. J Mach Learn Res 3:1439\u20131461","journal-title":"J Mach Learn Res"},{"issue":"2","key":"323_CR5","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, King A, Mazumder R et al (2016) Best subset selection via a modern optimization lens. Ann Stat 44(2):813\u2013852","journal-title":"Ann Stat"},{"key":"323_CR6","doi-asserted-by":"crossref","unstructured":"Civitelli E, Lapucci M, Schoen F, Sortino A (2021) An effective procedure for feature subset selection in logistic regression based on information criteria. Comput Optim Appl 1\u201332","DOI":"10.1007\/s10589-021-00288-1"},{"issue":"3","key":"323_CR7","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1007\/s10589-019-00134-5","volume":"74","author":"L Di Gangi","year":"2019","unstructured":"Di Gangi L, Lapucci M, Schoen F, Sortino A (2019) An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series. Comput Optim Appl 74(3):919\u2013948","journal-title":"Comput Optim Appl"},{"key":"323_CR8","unstructured":"Tillmann AM, Bienstock D, Lodi A, Schwartz A (2021) Cardinality minimization, constraints, and regularization: a survey. Preprint at http:\/\/arxiv.org\/abs\/2106.09606"},{"key":"323_CR9","unstructured":"Bertsekas D, Tsitsiklis J (2015) Parallel and distributed computation: Numerical methods. Athena Scientific"},{"issue":"4","key":"323_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1080\/10556789908805730","volume":"10","author":"L Grippo","year":"1999","unstructured":"Grippo L, Sciandrone M (1999) Globally convergent block-coordinate techniques for unconstrained optimization. Optimization methods and software 10(4):587\u2013637","journal-title":"Optimization methods and software"},{"issue":"4","key":"323_CR11","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu Z, Zhang Y (2013) Sparse approximation via penalty decomposition methods. SIAM J Optim 23(4):2448\u20132478","journal-title":"SIAM J Optim"},{"issue":"1","key":"323_CR12","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program 146(1):459\u2013494","journal-title":"Math Program"},{"key":"323_CR13","unstructured":"Bertsekas DP, Hager W, Mangasarian O (1999) Nonlinear programming. Athena Scientific Belmont: Massachusets, USA"},{"issue":"3","key":"323_CR14","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas DP (1997) Nonlinear programming. J Oper Res Soc 48(3):334\u2013334","journal-title":"J Oper Res Soc"},{"key":"323_CR15","doi-asserted-by":"crossref","unstructured":"Kanzow C, Lapucci M (2023) Inexact penalty decomposition methods for optimization problems with geometric constraints. Comput Optim Appl 1\u201335","DOI":"10.1007\/s10589-023-00475-2"},{"issue":"2","key":"323_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10957-020-01793-9","volume":"188","author":"M Lapucci","year":"2021","unstructured":"Lapucci M, Levato T, Sciandrone M (2021) Convergent inexact penalty decomposition methods for cardinality-constrained problems. J Optim Theory Appl 188(2):473\u2013496","journal-title":"J Optim Theory Appl"},{"key":"323_CR17","doi-asserted-by":"crossref","unstructured":"Bishop CM et al (1995) Neural networks for pattern recognition. Oxford University Press","DOI":"10.1093\/oso\/9780198538493.001.0001"},{"key":"323_CR18","doi-asserted-by":"crossref","unstructured":"Fasshauer GE (2007) Meshfree approximation methods with MATLAB, vol. 6. World Scientific","DOI":"10.1142\/6437"},{"issue":"9","key":"323_CR19","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1109\/5.58326","volume":"78","author":"T Poggio","year":"1990","unstructured":"Poggio T, Girosi F (1990) Networks for approximation and learning. Proc IEEE 78(9):1481\u20131497","journal-title":"Proc IEEE"},{"key":"323_CR20","doi-asserted-by":"crossref","unstructured":"Wendland H (2004) Scattered data approximation, vol. 17. Cambridge University Press","DOI":"10.1017\/CBO9780511617539"},{"issue":"8","key":"323_CR21","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1162\/08997660152469396","volume":"13","author":"C Buzzi","year":"2001","unstructured":"Buzzi C, Grippo L, Sciandrone M (2001) Convergent decomposition techniques for training RBF neural networks. Neural Comput 13(8):1891\u20131920","journal-title":"Neural Comput"},{"key":"323_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould NI, Orban D, Toint PL (2015) Cutest: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60:545\u2013557","journal-title":"Comput Optim Appl"},{"issue":"1","key":"323_CR23","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu DC, Nocedal J (1989) On the limited memory bfgs method for large scale optimization. Math Program 45(1):503\u2013528","journal-title":"Math Program"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00323-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00323-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00323-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T07:11:49Z","timestamp":1719904309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00323-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":23,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["323"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00323-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3866271\/v1","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"15 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}],"article-number":"41"}}