{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:03Z","timestamp":1740122403057,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72171141","71971132"],"award-info":[{"award-number":["72171141","71971132"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10898-022-01151-1","type":"journal-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T02:02:37Z","timestamp":1647396157000},"page":"369-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An adaptive high order method for finding third-order critical points of nonconvex optimization"],"prefix":"10.1007","volume":"84","author":[{"given":"Xihua","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiangze","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8924-3185","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"1151_CR1","unstructured":"Amaral, V., Andreani, R., Birgin, E., Marcondes, D., Mart\u00ednez, J.: On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. (2020) arXiv preprint arXiv:2009.01811"},{"key":"1151_CR2","unstructured":"Anandkumar, A., Ge, R.: Efficient approaches for escaping higher order saddle points in non-convex optimization. In: Conference on Learning Theory, pp 81\u2013102 (2016)"},{"key":"1151_CR3","unstructured":"Baes, M.: Estimate sequence methods: extensions and approximations. Institute for Operations Research, ETH, Z$$^{..1}$$rich, Switzerland (2009)"},{"issue":"4","key":"1151_CR4","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1137\/18M1226282","volume":"29","author":"S Bellavia","year":"2019","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, P.L.: Adaptive regularization algorithms with inexact evaluations for nonconvex optimization. SIAM J. Optim. 29(4), 2881\u20132915 (2019)","journal-title":"SIAM J. Optim."},{"key":"1151_CR5","unstructured":"Birgin, E., Kreji\u0107, N., Mart\u00ednez, J.: Economic inexact restoration for derivative-free expensive function minimization and applications. (2020) arXiv preprint arXiv:2009.09062"},{"key":"1151_CR6","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., 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":"1151_CR7","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/15M1031631","volume":"26","author":"EG Birgin","year":"2016","unstructured":"Birgin, E.G., Gardenghi, J., Martinez, J.M., Santos, S.A., Toint, P.L.: Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM J. Optim. 26(2), 951\u2013967 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1151_CR8","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., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Prog. 163(1\u20132), 359\u2013368 (2017)","journal-title":"Math. Prog."},{"key":"1151_CR9","unstructured":"Bubeck, S., Jiang, Q., Lee, Y.T., Li, Y., Sidford, A.: Near-optimal method for highly smooth convex optimization. In: Conference on Learning Theory, pp. 492\u2013507. PMLR (2019)"},{"key":"1151_CR10","first-page":"1","volume":"184","author":"Y Carmon","year":"2017","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points I. Math. Prog. 184, 1\u201350 (2017)","journal-title":"Math. Prog."},{"issue":"2","key":"1151_CR11","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2), 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1151_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"1151_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. part II: worst-case function-and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011)","journal-title":"Math. Program."},{"issue":"5","key":"1151_CR14","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s10208-017-9363-y","volume":"18","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization. Found. Comput. Math. 18(5), 1073\u20131107 (2018)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1151_CR15","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.I., Toint, P.L.: A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Opt. Methods Softw. 35(2), 243\u2013256 (2020)","journal-title":"Opt. Methods Softw."},{"issue":"1","key":"1151_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/17M1144854","volume":"30","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. SIAM J. Optim. 30(1), 513\u2013541 (2020)","journal-title":"SIAM J. Optim."},{"key":"1151_CR17","unstructured":"Chen, X., Jiang, B., Lin, T., Zhang, S.: Accelerating adaptive cubic regularization of Newton\u2019s method via random sampling. J. Mach. Learn. Res. (2022)"},{"issue":"1","key":"1151_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-020-01470-9","volume":"187","author":"X Chen","year":"2021","unstructured":"Chen, X., Toint, P.L.: High-order evaluation complexity for convexly-constrained optimization with non-lipschitzian group sparsity terms. Math. Program. 187(1), 47\u201378 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1151_CR19","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/18M1166511","volume":"29","author":"X Chen","year":"2019","unstructured":"Chen, X., Toint, P.L., Wang, H.: Complexity of partially separable convexly constrained optimization with Non-Lipschitzian singularities. SIAM J. Optim. 29(1), 874\u2013903 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1151_CR20","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1093\/imanum\/dry022","volume":"39","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: An inexact regularized Newton framework with a worst-case iteration complexity of for nonconvex optimization. IMA J. Numer. Anal. 39(3), 1296\u20131327 (2018)","journal-title":"IMA J. Numer. Anal."},{"issue":"1\u20132","key":"1151_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01834120","volume":"13","author":"JM Cushing","year":"1975","unstructured":"Cushing, J.M.: Extremal tests for scalar functions of several real variables at degenerate critical points. Aequationes Math. 13(1\u20132), 89\u201396 (1975)","journal-title":"Aequationes Math."},{"key":"1151_CR22","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1151_CR23","doi-asserted-by":"crossref","unstructured":"Gasnikov, A., Kovalev, D., Mohhamed, A., Chernousova, E.: The global rate of convergence for optimal tensor methods in smooth convex optimization. (2018) arXiv preprint arXiv:1809.00382","DOI":"10.20537\/2076-7633-2018-10-6-737-753"},{"issue":"3","key":"1151_CR24","doi-asserted-by":"publisher","first-page":"1854","DOI":"10.1007\/s10915-019-00915-4","volume":"79","author":"S Ghadimi","year":"2019","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Generalized uniformly optimal methods for nonlinear programming. J. Sci. Comput. 79(3), 1854\u20131881 (2019)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1151_CR25","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NI Gould","year":"1999","unstructured":"Gould, N.I., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1151_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-019-00064-2","volume":"73","author":"NI Gould","year":"2019","unstructured":"Gould, N.I., Rees, T., Scott, J.A.: 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."},{"key":"1151_CR27","doi-asserted-by":"crossref","unstructured":"Grapiglia, G.N., Nesterov, Y.: Tensor methods for finding approximate stationary points of convex functions. Optim. Methods Softw. pp. 1\u201334 (2020)","DOI":"10.1080\/10556788.2020.1818082"},{"issue":"4","key":"1151_CR28","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1137\/19M1259432","volume":"30","author":"GN Grapiglia","year":"2020","unstructured":"Grapiglia, G.N., Nesterov, Y.: 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."},{"issue":"1","key":"1151_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-020-01466-5","volume":"187","author":"S Gratton","year":"2021","unstructured":"Gratton, S., Simon, E., Toint, P.L.: An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. 187(1), 1\u201324 (2021)","journal-title":"Math. Program."},{"key":"1151_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72, 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1151_CR31","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1137\/19M1286025","volume":"30","author":"B Jiang","year":"2020","unstructured":"Jiang, B., Lin, T., Zhang, S.: A unified adaptive tensor approximation scheme to accelerate composite convex optimization. SIAM J. Optim. 30, 2897\u20132926 (2020)","journal-title":"SIAM J. Optim."},{"key":"1151_CR32","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1287\/moor.2020.1103","volume":"46","author":"B Jiang","year":"2021","unstructured":"Jiang, B., Wang, H., Zhang, S.: An optimal high-order tensor method for convex optimization. Math. Oper. Res. 46, 1390\u20131412 (2021)","journal-title":"Math. Oper. Res."},{"key":"1151_CR33","unstructured":"Lucchi, A., Kohler, J.: A stochastic tensor method for non-convex optimization. (2019) arXiv preprint arXiv:1911.10367"},{"issue":"4","key":"1151_CR34","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1137\/17M1115472","volume":"27","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M.: On high-order model regularization for constrained optimization. SIAM J. Optim. 27(4), 2447\u20132458 (2017)","journal-title":"SIAM J. Optim."},{"key":"1151_CR35","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent. In: Solla S., Leen T., M\u00fcller K. (eds.) Advances in neural information processing systems, vol 12, pp. 512\u2013518 (1999)"},{"key":"1151_CR36","unstructured":"Motzkin, T.S.: The arithmetic-geometric inequality. Inequalities (Proc. Sympos. Wright-Patterson Air Force Base, Ohio, 1965) pp. 205\u2013224 (1967)"},{"key":"1151_CR37","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K Murty","year":"1987","unstructured":"Murty, K., Kabadi, S.: Some np-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"issue":"5","key":"1151_CR38","first-page":"236","volume":"87","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization a basic course. Appl. Optim. 87(5), 236 (2004)","journal-title":"Appl. Optim."},{"issue":"1","key":"1151_CR39","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y.: Accelerating the cubic regularization of Newton\u2019s method on convex problems. Math. Program. 112(1), 159\u2013181 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"1151_CR40","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-019-01449-1","volume":"186","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Implementable tensor methods in unconstrained convex optimization. Math. Program. 186(1), 157\u2013183 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1151_CR41","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"1151_CR42","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10107-014-0845-2","volume":"151","author":"J Nie","year":"2015","unstructured":"Nie, J.: The hierarchy of local minimums in polynomial optimization. Math. Program. 151(2), 555\u2013583 (2015)","journal-title":"Math. Program."},{"key":"1151_CR43","unstructured":"Udell, M., Boyd, S.: Maximizing a sum of sigmoids. Optim. Eng.pp. 1\u201325 (2013)"},{"key":"1151_CR44","unstructured":"Zheng, Y., Zheng, B.: A modified adaptive cubic regularization method for large-scale unconstrained optimization problem. (2019) arXiv preprint arXiv:1904.07440"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01151-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01151-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01151-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T10:11:03Z","timestamp":1663755063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01151-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,16]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1151"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01151-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,3,16]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}