{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:36Z","timestamp":1740123696388,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:00:00Z","timestamp":1700265600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:00:00Z","timestamp":1700265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["FRF-BR-20-02B"],"award-info":[{"award-number":["FRF-BR-20-02B"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11075-023-01700-z","type":"journal-article","created":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T12:02:13Z","timestamp":1700308933000},"page":"191-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A two-metric variable scaled forward-backward algorithm for $$\\ell _0$$ optimization problem and its applications"],"prefix":"10.1007","volume":"97","author":[{"given":"Qian","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5472-2242","authenticated-orcid":false,"given":"Zhengwei","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,18]]},"reference":[{"key":"1700_CR1","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical learning with sparsity (2015)","DOI":"10.1201\/b18401"},{"key":"1700_CR2","doi-asserted-by":"publisher","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.862083","DOI":"10.1109\/TIT.2005.862083"},{"key":"1700_CR3","doi-asserted-by":"publisher","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54, 4311\u20134322 (2006). https:\/\/doi.org\/10.1109\/TSP.2006.881199","DOI":"10.1109\/TSP.2006.881199"},{"key":"1700_CR4","doi-asserted-by":"publisher","unstructured":"Chouzenoux, E., Jezierska, A., Pesquet, J.C., Talbot, H.: A majorize-minimize subspace approach for $$\\ell _2$$-$$\\ell _0$$ image regularization. SIAM J. Imag. Sci. 6, 563\u2013591 (2013). https:\/\/doi.org\/10.1137\/11085997X","DOI":"10.1137\/11085997X"},{"key":"1700_CR5","unstructured":"Louizos, C., Welling, M., Kingma, D.P.: Learning sparse neural networks through $$\\ell _0$$ regularization. 6th International Conference on Learning Representations, ICLR 2018 - Conference Track Proceedings (2018)"},{"key":"1700_CR6","doi-asserted-by":"publisher","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137, 91\u2013129 (2013). https:\/\/doi.org\/10.1007\/s10107-011-0484-9","DOI":"10.1007\/s10107-011-0484-9"},{"issue":"3","key":"1700_CR7","first-page":"1433","volume":"2006","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J.: Compressive sampling. International Congress of Mathematicians, ICM 2006(3), 1433\u20131452 (2006)","journal-title":"International Congress of Mathematicians, ICM"},{"key":"1700_CR8","doi-asserted-by":"publisher","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","DOI":"10.1109\/TIT.2006.871582"},{"key":"1700_CR9","doi-asserted-by":"publisher","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 111\u2013119 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","DOI":"10.1007\/s10208-009-9045-5"},{"key":"1700_CR10","doi-asserted-by":"publisher","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010). https:\/\/doi.org\/10.1137\/070697835","DOI":"10.1137\/070697835"},{"key":"1700_CR11","doi-asserted-by":"crossref","unstructured":"Elad, M.: Sparse and redundant representations: from theory to applications in signal and image processing (2010)","DOI":"10.1007\/978-1-4419-7011-4"},{"key":"1700_CR12","doi-asserted-by":"publisher","unstructured":"Bonettini, S., Benfenati, A., Ruggiero, V.: Scaling techniques for $$\\epsilon $$-subgradient methods. SIAM J. Optimizat. 26 (2016). https:\/\/doi.org\/10.1137\/14097642X","DOI":"10.1137\/14097642X"},{"key":"1700_CR13","doi-asserted-by":"publisher","unstructured":"Davis, D., Drusvyatskiy, D., MacPhee, K.J., Paquette, C.: Subgradient methods for sharp weakly convex functions. J. Optimizat. Theory Appl. 179 (2018). https:\/\/doi.org\/10.1007\/s10957-018-1372-8","DOI":"10.1007\/s10957-018-1372-8"},{"key":"1700_CR14","doi-asserted-by":"publisher","unstructured":"Renegar, J.: Efficient subgradient methods for general convex optimization. SIAM J. Optimizat. 26 (2016). https:\/\/doi.org\/10.1137\/15M1027371","DOI":"10.1137\/15M1027371"},{"key":"1700_CR15","doi-asserted-by":"publisher","unstructured":"Tong, T., Ma, C., Chi, Y.: Low-rank matrix recovery with scaled subgradient methods: fast and robust convergence without the condition number. IEEE Trans. Signal Process. 69 (2021). https:\/\/doi.org\/10.1109\/TSP.2021.3071560","DOI":"10.1109\/TSP.2021.3071560"},{"key":"1700_CR16","doi-asserted-by":"publisher","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.A.: A family of variable metric proximal methods. Math. Program. 68 (1995). https:\/\/doi.org\/10.1007\/BF01585756","DOI":"10.1007\/BF01585756"},{"key":"1700_CR17","doi-asserted-by":"publisher","unstructured":"Burke, J.V., Qian, M.: Variable metric proximal point algorithm for monotone operators. SIAM J. Control Optimizat. 37 (1998). https:\/\/doi.org\/10.1137\/s0363012992235547","DOI":"10.1137\/s0363012992235547"},{"key":"1700_CR18","doi-asserted-by":"publisher","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function. J. Optim. Theory Appl. 162, 107\u2013132 (2014). https:\/\/doi.org\/10.1007\/s10957-013-0465-7","DOI":"10.1007\/s10957-013-0465-7"},{"key":"1700_CR19","doi-asserted-by":"publisher","unstructured":"Chen, X., Fukushima, M.: Proximal quasi-Newton methods for nondifferentiable convex optimization. Mathematical Programming, Series B 85, 313\u2013334 (1999). https:\/\/doi.org\/10.1007\/s101070050059","DOI":"10.1007\/s101070050059"},{"key":"1700_CR20","doi-asserted-by":"publisher","unstructured":"Fuentes, M., Malick, J., Lemar\u00e9chal, C.: Descentwise inexact proximal algorithms for smooth optimization. Comput. Optim. Appl. 53, 755\u2013769 (2012). https:\/\/doi.org\/10.1007\/s10589-012-9461-3","DOI":"10.1007\/s10589-012-9461-3"},{"key":"1700_CR21","doi-asserted-by":"publisher","unstructured":"Fukushima, M., Qi, L.: A globally and superlinearly convergent algorithm for nonsmooth convex minimization. SIAM J. Optim. 6, 298\u2013321 (1996). https:\/\/doi.org\/10.1137\/S1052623494278839","DOI":"10.1137\/S1052623494278839"},{"key":"1700_CR22","doi-asserted-by":"publisher","unstructured":"Burke, J.V., Qian, M.: On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating. Mathematical Programming, Series B 88, 157\u2013181 (2000). https:\/\/doi.org\/10.1007\/PL00011373","DOI":"10.1007\/PL00011373"},{"key":"1700_CR23","doi-asserted-by":"publisher","unstructured":"Bonettini, S., Porta, F., Ruggiero, V., Zanni, L.: Variable metric techniques for forward-backward methods in imaging. J. Comput. Appl. Math. 385, 113192 (2021). https:\/\/doi.org\/10.1016\/j.cam.2020.113192","DOI":"10.1016\/j.cam.2020.113192"},{"key":"1700_CR24","doi-asserted-by":"publisher","unstructured":"Pock, T., Chambolle, A.: Diagonal preconditioning for first order primal-dual algorithms in convex optimization. Proceedings of the IEEE International Conference on Computer Vision, 1762\u20131769 (2011). https:\/\/doi.org\/10.1109\/ICCV.2011.6126441","DOI":"10.1109\/ICCV.2011.6126441"},{"key":"1700_CR25","first-page":"2618","volume":"4","author":"S Becker","year":"2012","unstructured":"Becker, S., Fadili, M.J.: A quasi-Newton proximal splitting method. Adv. Neural. Inf. Process. Syst. 4, 2618\u20132626 (2012)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1700_CR26","doi-asserted-by":"publisher","unstructured":"Jiang, F., Cai, X., Han, D.: The indefinite proximal point algorithms for maximal monotone operators. Optimization 70 (2021). https:\/\/doi.org\/10.1080\/02331934.2020.1751158","DOI":"10.1080\/02331934.2020.1751158"},{"key":"1700_CR27","doi-asserted-by":"publisher","unstructured":"He, H., Cai, X., Han, D.: A class of nonlinear proximal point algorithms for variational inequality problems. Int. J. Comput. Math. 92 (2015). https:\/\/doi.org\/10.1080\/00207160.2014.940333","DOI":"10.1080\/00207160.2014.940333"},{"key":"1700_CR28","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. Soc. Ind. Appl. Math. (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"1700_CR29","doi-asserted-by":"publisher","unstructured":"Anh, P.N., Thang, T.V., Thach, H.T.C.: A subgradient proximal method for solving a class of monotone multivalued variational inequality problems. Numerical Algorithms 1\u201322 (2021). https:\/\/doi.org\/10.1007\/s11075-021-01119-4","DOI":"10.1007\/s11075-021-01119-4"},{"key":"1700_CR30","doi-asserted-by":"crossref","unstructured":"J.D.\u00a0Lee, Y.S., M.A.Saunders: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optimizat. 24(3), 1420\u20131443 (2014)","DOI":"10.1137\/130921428"},{"key":"1700_CR31","doi-asserted-by":"publisher","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. Society for Industrial and Applied Mathematics (1990). https:\/\/doi.org\/10.1137\/1.9781611971309","DOI":"10.1137\/1.9781611971309"},{"key":"1700_CR32","doi-asserted-by":"crossref","unstructured":"A.\u00a0Bagirov, N.K., M\u00e4kel\u00e4, M.M.: Introduction to nonsmooth optimization: theory, practice and software. Spring (2014)","DOI":"10.1007\/978-3-319-08114-4"},{"key":"1700_CR33","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Conjugate duality and optimization (1974)","DOI":"10.1137\/1.9781611970524"},{"issue":"1","key":"1700_CR34","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1137\/140971518","volume":"8","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Dosovitskiy, A., Brox, T., Pock, T.: On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision. SIAM J. Imag. Sci. 8(1), 331\u2013372 (2015)","journal-title":"SIAM J. Imag. Sci."},{"key":"1700_CR35","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s10957-018-01452-0","volume":"181","author":"P Ochs","year":"2019","unstructured":"Ochs, P., Fadili, J., Brox, T.: Non-smooth non-convex Bregman minimization: unification and new algorithms. J. Optim. Theory Appl. 181, 244\u2013278 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1700_CR36","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/19M1277552","volume":"31","author":"A Repetti","year":"2021","unstructured":"Repetti, A., Wiaux, Y.: Variable metric forward-backward algorithm for composite minimization problems. SIAM J. Optim. 31(2), 1215\u20131241 (2021). https:\/\/doi.org\/10.1137\/19M1277552","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1700_CR37","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1137\/18M1171989","volume":"11","author":"J Geiping","year":"2018","unstructured":"Geiping, J., Moeller, M.: Composite optimization by nonconvex majorization-minimization. SIAM J. Imag. Sci. 11(4), 2494\u20132528 (2018)","journal-title":"SIAM J. Imag. Sci."},{"key":"1700_CR38","doi-asserted-by":"publisher","unstructured":"Malek-Mohammadi, M., Koochakzadeh, A., Babaie-Zadeh, M., Jansson, M., Rojas, C.R.: Successive concave sparsity approximation for compressed sensing. IEEE Trans. Signal Process. 64, 5657\u20135671 (2016). https:\/\/doi.org\/10.1109\/TSP.2016.2585096","DOI":"10.1109\/TSP.2016.2585096"},{"key":"1700_CR39","doi-asserted-by":"publisher","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optimizat. 1 (1991). https:\/\/doi.org\/10.1137\/0801001","DOI":"10.1137\/0801001"},{"key":"1700_CR40","doi-asserted-by":"publisher","unstructured":"Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J. 6 (1963). https:\/\/doi.org\/10.1093\/comjnl\/6.2.163","DOI":"10.1093\/comjnl\/6.2.163"},{"key":"1700_CR41","unstructured":"Chong, E.K.P., \u017bak, S.H.: An introduction to optimization ed. 4. (2013)"},{"key":"1700_CR42","unstructured":"Bertsekas, D.P.: Nonlinear programming, Third Edition (2016)"},{"issue":"1","key":"1700_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"1700_CR44","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational analysis (2017)"},{"key":"1700_CR45","doi-asserted-by":"publisher","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2, 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","DOI":"10.1137\/080716542"},{"key":"1700_CR46","doi-asserted-by":"publisher","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131360 (2001). https:\/\/doi.org\/10.1198\/016214501753382273","DOI":"10.1198\/016214501753382273"},{"key":"1700_CR47","doi-asserted-by":"publisher","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27, 265\u2013274 (2009). https:\/\/doi.org\/10.1016\/j.acha.2009.04.002","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"1700_CR48","doi-asserted-by":"publisher","unstructured":"Blumensath, T., Davies, M.E.: Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14, 629\u2013654 (2008). https:\/\/doi.org\/10.1007\/s00041-008-9035-z","DOI":"10.1007\/s00041-008-9035-z"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01700-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01700-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01700-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:23:35Z","timestamp":1722936215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01700-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,18]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1700"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01700-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,11,18]]},"assertion":[{"value":"4 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2023","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":"Conflict of interest"}}]}}