{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:47:33Z","timestamp":1765547253348,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of Chin","doi-asserted-by":"publisher","award":["11971149"],"award-info":[{"award-number":["11971149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271217"],"award-info":[{"award-number":["12271217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["232300421018"],"award-info":[{"award-number":["232300421018"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10589-024-00576-6","type":"journal-article","created":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T18:02:56Z","timestamp":1715018576000},"page":"849-870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid inexact regularized Newton and negative curvature method"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0940-8059","authenticated-orcid":false,"given":"Hong","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yunhai","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,6]]},"reference":[{"issue":"6","key":"576_CR1","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization problems. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"576_CR2","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Optimal Newton-type methods for nonconvex optimization. Technical Report naXys-17-2011 (2011)"},{"key":"576_CR3","unstructured":"Chen, J., Ng, K.M.: Error bound of empirical $$\\ell _2$$ risk minimization for noisy standard and generalized phase retrieval problems (2022). https:\/\/arxiv.org\/abs\/2205.13827v1"},{"key":"576_CR4","unstructured":"Fan, J., Sun, J., Yan, A., Zhou, S.: An oracle gradient regularized Newton method for quadratic measurements regression (2022). https:\/\/doi.org\/10.48550\/arXiv.2202.09651"},{"key":"576_CR5","doi-asserted-by":"publisher","first-page":"1734","DOI":"10.1137\/22M1489824","volume":"33","author":"C He","year":"2022","unstructured":"He, C., Lu, Z.S., Pong, T.K.: A Newton-CG based augmented Lagrangian method for finding a second-order stationary point of nonconvex equality constrained optimization with complexity guarantees. SIAM J. Optimiz. 33, 1734\u20131766 (2022)","journal-title":"SIAM J. Optimiz."},{"key":"576_CR6","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms, Technical report NA\/12 (1981)"},{"key":"576_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0314020","volume":"14","author":"WB Kort","year":"1976","unstructured":"Kort, W.B., Bersekas, P.D.: Combined primal-dual and penalty methods for convex programming. SIAM J. Control Optim. 14, 268\u2013294 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"576_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/B:COAP.0000026881.96694.32","volume":"28","author":"DH Li","year":"2004","unstructured":"Li, D.H., Fukushima, M., Qi, L., Yamashita, N.: Regularized Newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28, 131\u2013147 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"576_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.4208\/csiam-am.SO-2021-0016","volume":"2","author":"X Liu","year":"2021","unstructured":"Liu, X., Wen, Z.W., Yuan, Y.X.: Subspace methods for nonlinear optimization. CSIAM Trans. Appl. Math. 2(4), 585\u2013651 (2021)","journal-title":"CSIAM Trans. Appl. Math."},{"issue":"3","key":"576_CR10","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/22M1488752","volume":"33","author":"K Mishchenko","year":"2023","unstructured":"Mishchenko, K.: Regularized Newton method with global $$O(1\/k^2)$$ Convergence. SIAM J. Optim. 33(3), 1440\u20131462 (2023)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"576_CR11","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, R.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"576_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF02614322","volume":"79","author":"JS Pang","year":"1997","unstructured":"Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299\u2013332 (1997)","journal-title":"Math. Program."},{"key":"576_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","volume":"120","author":"RA Polyak","year":"2009","unstructured":"Polyak, R.A.: Regularized Newton method for unconstrained convex optimization. Math. Program. 120, 125\u2013145 (2009)","journal-title":"Math. Program."},{"key":"576_CR14","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-019-01362-7","volume":"180","author":"CW Royer","year":"2020","unstructured":"Royer, C.W., O\u2019Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180, 451\u2013488 (2020)","journal-title":"Math. Program."},{"key":"576_CR15","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming, vol. 1, Springer Science & Business Media (2006)"},{"key":"576_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl. Math. Optim. 62, 27\u201346 (2010)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"576_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.acha.2017.09.003","volume":"47","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Xu, Z.: Generalized phase retrieval: measurement number, matrix recovery and beyond. Appl. Comput. Harmon. Anal. 47(2), 423\u2013446 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"576_CR18","doi-asserted-by":"crossref","unstructured":"Xie, Y., Wright, S.J.: Complexity of a projected Newton-CG method for optimization with bounds, Math. Program (2023)","DOI":"10.1007\/s10107-023-02000-z"},{"key":"576_CR19","unstructured":"Yuan, Y.X.: A review on subspace methods for nonlinear optimization. In Proceedings of the International Congress of Mathematics, 807-827 (2014)"},{"key":"576_CR20","unstructured":"Zhang, C.W., Ge, D.D., He, C., Jiang, B., Jiang, Y.T., Ye, Y.Y.: DRSOM: A dimension reduced second-order method (2022). https:\/\/export.arxiv.org\/abs\/2208.00208"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00576-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00576-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00576-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T08:05:56Z","timestamp":1718179556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00576-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00576-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,5,6]]},"assertion":[{"value":"1 August 2023","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":"6 May 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 data that support the findings of this study are available from the corresponding author upon request. The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}