{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T11:51:37Z","timestamp":1776081097074,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,6]],"date-time":"2021-02-06T00:00:00Z","timestamp":1612569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,6]],"date-time":"2021-02-06T00:00:00Z","timestamp":1612569600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["18K11179"],"award-info":[{"award-number":["18K11179"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007695","name":"Research Institute for Mathematical Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007695","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["20K11698"],"award-info":[{"award-number":["20K11698"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["20K14986"],"award-info":[{"award-number":["20K14986"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10589-021-00264-9","type":"journal-article","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:44:28Z","timestamp":1612824268000},"page":"127-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7780-8348","authenticated-orcid":false,"given":"Shummin","family":"Nakayama","sequence":"first","affiliation":[]},{"given":"Yasushi","family":"Narushima","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Yabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,6]]},"reference":[{"key":"264_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1080\/02331939508844035","volume":"32","author":"M Al-Baali","year":"1995","unstructured":"Al-Baali, M.: On measure functions for the self-scaling updating formulae for quasi-Newton methods. Optimization 32, 59\u201369 (1995)","journal-title":"Optimization"},{"key":"264_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Method in Optimization, MOS-SIAM Series on Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Method in Optimization, MOS-SIAM Series on Optimization. SIAM, New Delhi (2017)"},{"key":"264_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"264_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e9s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"key":"264_CR5","unstructured":"Becker, S., Cand\u00e9s, E.J., Grant M.C.: TFOCS website. http:\/\/cvxr.com\/tfocs\/download\/ (latest access: Jun 5, 2020)"},{"key":"264_CR6","doi-asserted-by":"publisher","first-page":"2445","DOI":"10.1137\/18M1167152","volume":"29","author":"S Becker","year":"2019","unstructured":"Becker, S., Fadili, J., Ochs, P.: On quasi-newton forward-backward splitting: proximal calculus and convergence. SIAM J. Optim. 29, 2445\u20132481 (2019)","journal-title":"SIAM J. Optim."},{"key":"264_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10556780008805771","volume":"13","author":"PS Bradley","year":"2000","unstructured":"Bradley, P.S., Mangasarian, O.L.: Massive data discrimination via linear support vector machines. Optim. Methods Softw. 13, 1\u201310 (2000)","journal-title":"Optim. Methods Softw."},{"key":"264_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"264_CR9","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM data: classification, regression, and multi-label. https:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\/ (latest access: Jun 5, 2020)"},{"key":"264_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10957-010-9652-y","volume":"146","author":"WY Cheng","year":"2010","unstructured":"Cheng, W.Y., Li, D.H.: Spectral scaling BFGS method. J. Optim. Theory Appl. 146, 305\u2013319 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"264_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"264_CR12","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12, 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"264_CR13","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.22.3.754","volume":"22","author":"LE Gibbons","year":"1997","unstructured":"Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximal clique problem. Math. Oper. Res. 22, 754\u2013768 (1997)","journal-title":"Math. Oper. Res."},{"key":"264_CR14","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1093\/imamat\/10.3.394","volume":"10","author":"S Hoshino","year":"1972","unstructured":"Hoshino, S.: A formulation of variable metric methods. IMA J. Appl. Math. 10, 394\u2013403 (1972)","journal-title":"IMA J. Appl. Math."},{"key":"264_CR15","first-page":"1519","volume":"8","author":"K Koh","year":"2007","unstructured":"Koh, K., Kim, S.J., Boyd, S.: An interior-point method for large-scale $$\\ell _1$$-regularized logistic regression. J. Mach. Learn. Res. 8, 1519\u20131555 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"264_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10957-014-0528-4","volume":"165","author":"CX Kou","year":"2015","unstructured":"Kou, C.X., Dai, Y.H.: A modified self-scaling memoryless Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno method for unconstrained optimization. J. Optim. Theory Appl. 165, 209\u2013224 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"264_CR17","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24, 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"key":"264_CR18","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: PNOPT website. https:\/\/web.stanford.edu\/group\/SOL\/software\/pnopt\/ (latest access: Jun 5, 2020)"},{"key":"264_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-016-0566-9","volume":"85","author":"J Li","year":"2017","unstructured":"Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal Newton methods for self-concordant functions. Math. Methods Oper. Res. 85, 19\u201341 (2017)","journal-title":"Math. Methods Oper. Res."},{"key":"264_CR20","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"264_CR21","unstructured":"Liu, X., Hsieh, C.J., Lee, J.D., Sun, Y.: An inexact subsampled proximal Newton-type method for large-scale machine learning. arXiv:1708.08552 (2017)"},{"key":"264_CR22","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Financ. 7, 77\u201391 (1952)","journal-title":"J. Financ."},{"key":"264_CR23","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.3844\/ajassp.2009.2054.2059","volume":"6","author":"F Modarres","year":"2009","unstructured":"Modarres, F., Hassan, M.A., Leong, W.J.: Memoryless modified symmetric rank-one method for large-scale unconstrained optimization. Am. J. Appl. Sci. 6, 2054\u20132059 (2009)","journal-title":"Am. J. Appl. Sci."},{"key":"264_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/02331934.2014.994625","volume":"65","author":"AU Moyi","year":"2016","unstructured":"Moyi, A.U., Leong, W.J.: A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization. Optimization 65, 121\u2013143 (2016)","journal-title":"Optimization"},{"key":"264_CR25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.55937\/sut\/1547386572","volume":"54","author":"S Nakayama","year":"2018","unstructured":"Nakayama, S.: A hybrid method of three-term conjugate gradient method and memoryless quasi-Newton method for unconstrained optimization. SUT J. Math. 54, 79\u201398 (2018)","journal-title":"SUT J. Math."},{"key":"264_CR26","first-page":"53","volume":"61","author":"S Nakayama","year":"2018","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: A memoryless symmetric rank-one method with sufficient descent property for unconstrained optimization. J. Oper. Res. Soc. Jpn. 61, 53\u201370 (2018)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"264_CR27","doi-asserted-by":"crossref","first-page":"1773","DOI":"10.3934\/jimo.2018122","volume":"15","author":"S Nakayama","year":"2019","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization. J. Ind. Manag. Optim. 15, 1773\u20131793 (2019)","journal-title":"J. Ind. Manag. Optim."},{"key":"264_CR28","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course, 87","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, 87. Springer, Berlin (2003)"},{"key":"264_CR29","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-016-0997-3","volume":"160","author":"K Scheinberg","year":"2016","unstructured":"Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis. Math. Program. 160, 495\u2013529 (2016)","journal-title":"Math. Program."},{"key":"264_CR30","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 244\u2013256 (1978)","journal-title":"Math. Oper. Res."},{"key":"264_CR31","doi-asserted-by":"publisher","first-page":"2246","DOI":"10.1093\/bioinformatics\/btg308","volume":"19","author":"SK Shevade","year":"2003","unstructured":"Shevade, S.K., Keerthi, S.S.: A simple and efficient algorithm for gene selection using sparse logistic regression. Bioinformatics 19, 2246\u20132253 (2003)","journal-title":"Bioinformatics"},{"key":"264_CR32","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"264_CR33","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, Berlin (2006)"},{"key":"264_CR34","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28, 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"key":"264_CR35","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-030-25939-6_15","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Ahookhosh, M., Patrinos, P.: On the acceleration of forward-backward splitting via an inexact Newton method. In:\u00a0Bauschke, H.H., Burachik, R.S., Luke, D.R. (eds.)\u00a0Splitting Algorithms, Modern Operator Theory, and Applications, pp. 363\u2013412. Springer, Cham (2019)"},{"key":"264_CR36","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"264_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1111\/j.1467-9868.2011.00771.x","volume":"73","author":"R Tibshirani","year":"2011","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso: a retrospective. J. R. Stat. Soc. Ser. B 73, 273\u2013282 (2011)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"264_CR38","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/16M1055323","volume":"27","author":"B Wen","year":"2017","unstructured":"Wen, B., Chen, X., Pong, T.K.: Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems. SIAM J. Optim. 27, 124\u2013145 (2017)","journal-title":"SIAM J. Optim."},{"key":"264_CR39","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"264_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"MM Yuan","year":"2006","unstructured":"Yuan, M.M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"264_CR41","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1093\/imanum\/8.4.487","volume":"8","author":"Y Zhang","year":"1988","unstructured":"Zhang, Y., Tewarson, P.: Quasi-Newton algorithms with updates from the preconvex part of Broyden\u2019s family. IMA J. Numer. Anal. 8, 487\u2013509 (1988)","journal-title":"IMA J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00264-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-021-00264-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00264-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T21:12:55Z","timestamp":1724447575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-021-00264-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,6]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["264"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00264-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,6]]},"assertion":[{"value":"23 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}