{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T06:01:15Z","timestamp":1775628075211,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T00:00:00Z","timestamp":1696896000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10589-023-00533-9","type":"journal-article","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T12:02:02Z","timestamp":1696939322000},"page":"441-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficiency of higher-order algorithms for minimizing composite functions"],"prefix":"10.1007","volume":"87","author":[{"given":"Yassine","family":"Nabou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,10]]},"reference":[{"issue":"1\u20132","key":"533_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"533_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017)","journal-title":"Math. Program."},{"key":"533_CR3","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11590-019-01395-z","volume":"14","author":"EG Birgin","year":"2020","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A.: On the use of third-order models with fourth-order regularization for unconstrained optimization. Optim. Lett. 14, 815\u2013838 (2020)","journal-title":"Optim. Lett."},{"issue":"2","key":"533_CR4","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM 18(2), 556\u2013572 (2007)","journal-title":"SIAM"},{"key":"533_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01382-3","volume":"182","author":"J Bolte","year":"2020","unstructured":"Bolte, J., Chen, Z., Pauwels, E.: The multiproximal linearization method for convex composite problems. Math. Prog. 182, 1\u201336 (2020)","journal-title":"Math. Prog."},{"key":"533_CR6","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.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"533_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/10556788.2019.1678033","volume":"35","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N., Toint, P.L.: A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim. Methods Softw. 35, 243\u2013256 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20132","key":"533_CR8","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178(1\u20132), 503\u2013558 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"533_CR9","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1137\/21M1410063","volume":"32","author":"N Doikov","year":"2022","unstructured":"Doikov, N., Nesterov, Yu.: Optimization methods for fully composite problems. SIAM J. Optim. 32(3), 2402\u20132427 (2022)","journal-title":"SIAM J. Optim."},{"key":"533_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0120959","volume":"17","author":"R Fletcher","year":"1982","unstructured":"Fletcher, R.: A model algorithm for composite NDO problems. Math. Program. Stud. 17, 67\u201376 (1982)","journal-title":"Math. Program. Stud."},{"key":"533_CR11","unstructured":"Gasnikov, A., Dvurechensky, P., Gorbunov, E., Vorontsova, E., Selikhanovych, D., Uribe, C., Jiang, B., Wang, H., Zhang, S., Bubeck, S., Jiang, Q.: Near optimal methods for minimizing convex functions with Lipschitz $$p$$th derivatives. Conf. on Learning Theory 1392\u20131393 (2019)"},{"issue":"1","key":"533_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-019-00064-2","volume":"73","author":"NIM Gould","year":"2019","unstructured":"Gould, N.I.M., Rees, T., Scott, J.: Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems. Comput. Optim. Appl. 73(1), 1\u201335 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"533_CR13","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1137\/19M1259432","volume":"30","author":"G Grapiglia","year":"2020","unstructured":"Grapiglia, G., Nesterov, Yu.: Tensor methods for minimizing convex functions with H\u00f6lder continuous higher-order derivatives. SIAM J. Optim. 30(4), 2750\u20132779 (2020)","journal-title":"SIAM J. Optim."},{"key":"533_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.24033\/msmf.261","volume":"60","author":"J-B Hiriart-Urruty","year":"1979","unstructured":"Hiriart-Urruty, J.-B.: New concepts in nondifferentiable programming. Memoires de la Societe Mathematique de France 60, 57\u201385 (1979)","journal-title":"Memoires de la Societe Mathematique de France"},{"issue":"2","key":"533_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1137\/06065622X","volume":"18","author":"C Li","year":"2007","unstructured":"Li, C., Ng, K.F.: Majorizing functions and convergence of the Gauss-Newton method for convex composite optimization. SIAM J. Optim. 18(2), 613\u2013642 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"533_CR16","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/140957639","volume":"25","author":"J Mairal","year":"2015","unstructured":"Mairal, J.: Incremental majorization-minimization optimization with application to large-scale machine learning. SIAM J. Optim. 25(2), 829\u2013855 (2015)","journal-title":"SIAM J. Optim."},{"key":"533_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation. Basic Theory","author":"B Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.: Variational Analysis and Generalized Differentiation. Basic Theory. Springer, Berlin (2006)"},{"issue":"1","key":"533_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J More","year":"1981","unstructured":"More, J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Transat. Math. Soft. 7(1), 17\u201341 (1981)","journal-title":"ACM Transat. Math. Soft."},{"key":"533_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Yu., Glineur, F.: Linear convergence of first-order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019)","journal-title":"Math. Program."},{"key":"533_CR20","unstructured":"Necoara, I., Lupu, D.: General higher-order majorization-minimization algorithms for (non) convex optimization (2020). arXiv preprint: arXiv:2010.13893"},{"key":"533_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Yu Nesterov","year":"1994","unstructured":"Nesterov, Yu., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)"},{"key":"533_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu Nesterov","year":"2005","unstructured":"Nesterov, Yu.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"533_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Yu Nesterov","year":"2006","unstructured":"Nesterov, Yu., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"533_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-019-01449-1","volume":"186","author":"Yu Nesterov","year":"2021","unstructured":"Nesterov, Yu.: Implementable tensor methods in unconstrained convex optimization. Math. Program. 186, 157\u2013183 (2021)","journal-title":"Math. Program."},{"key":"533_CR25","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1080\/10556788.2020.1854252","volume":"37","author":"Yu Nesterov","year":"2022","unstructured":"Nesterov, Yu.: Inexact basic tensor methods for some classes of convex optimization problems. Optim. Methods Soft 37, 878\u2013906 (2022)","journal-title":"Optim. Methods Soft"},{"issue":"1","key":"533_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Yu Nesterov","year":"2013","unstructured":"Nesterov, Yu.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"533_CR27","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1016\/j.orl.2016.10.003","volume":"44","author":"E Pauwels","year":"2016","unstructured":"Pauwels, E.: The value function approach to convergence analysis in composite optimization. Oper. Res. Lett. 44, 790\u2013795 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"533_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"533_CR29","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/BF02591750","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: Conditions for convergence of trust-region algorithms for nonsmooth optimization. Math. Program. 31, 220\u2013228 (1985)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00533-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00533-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00533-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:09:22Z","timestamp":1707764962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00533-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00533-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,10]]},"assertion":[{"value":"23 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}