{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:36:17Z","timestamp":1758875777266,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T00:00:00Z","timestamp":1553126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475-7","2013\/07375-0"],"award-info":[{"award-number":["2013\/05475-7","2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["309517\/2014-1","303750\/2014-6"],"award-info":[{"award-number":["309517\/2014-1","303750\/2014-6"]}],"id":[{"id":"10.13039\/501100003593","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":[[2019,7]]},"DOI":"10.1007\/s10589-019-00089-7","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:02:54Z","timestamp":1553162574000},"page":"707-753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"given":"E. G.","family":"Birgin","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,21]]},"reference":[{"key":"89_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia (1999). \n                    https:\/\/doi.org\/10.1137\/1.9780898719604","edition":"3"},{"key":"89_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10589-017-9929-2","volume":"68","author":"E Bergou","year":"2017","unstructured":"Bergou, E., Diouane, Y., Gratton, S.: On the use of the energy norm in trust-region and adaptive cubic regularization subproblems. Comput. Optim. Appl. 68, 533\u2013554 (2017). \n                    https:\/\/doi.org\/10.1007\/s10589-017-9929-2","journal-title":"Comput. Optim. Appl."},{"unstructured":"Bergou, E., Diouane, Y., Gratton, S.: A line-search algorithm inspired by the adaptive cubic regularization framework, with a worst-case complexity \n                    \n                      \n                    \n                    $$ O(\\varepsilon ^{-3\/2})$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            \u03b5\n                            \n                              -\n                              3\n                              \/\n                              2\n                            \n                          \n                          )\n                        \n                      \n                    \n                  , technical report. \n                    http:\/\/www.optimization-online.org\/DB-HTML\/2017\/06\/6083.html\n                    \n                   (2017)","key":"89_CR3"},{"key":"89_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10589-012-9466-y","volume":"53","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Gentil, J.M.: Evaluating bound-constrained minimization software. Comput. Optim. Appl. 53, 347\u2013373 (2012). \n                    https:\/\/doi.org\/10.1007\/s10589-012-9466-y","journal-title":"Comput. Optim. Appl."},{"key":"89_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Optimization, Vol. 10 of Fundamentals of Algorithms","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization, Vol. 10 of Fundamentals of Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (2014). \n                    https:\/\/doi.org\/10.1137\/1.9781611973365"},{"key":"89_CR6","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1137\/16M110280X","volume":"27","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM J. Optim. 27, 1049\u20131074 (2017). \n                    https:\/\/doi.org\/10.1137\/16M110280X","journal-title":"SIAM J. Optim."},{"key":"89_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1137\/17M1127107","volume":"28","author":"EG Birgin","year":"2018","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: On regularization and active-set methods with complexity for constrained optimization. SIAM J. Optim. 28, 1367\u20131395 (2018). \n                    https:\/\/doi.org\/10.1137\/17M1127107","journal-title":"SIAM J. Optim."},{"key":"89_CR8","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20, 2833\u20132852 (2010). \n                    https:\/\/doi.org\/10.1137\/090774100","journal-title":"SIAM J. Optim."},{"key":"89_CR9","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.M., Toint, P.L.: Adaptive cubic regularization methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011). \n                    https:\/\/doi.org\/10.1007\/s10107-009-0286-5","journal-title":"Math. Program."},{"key":"89_CR10","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.M., Toint, P.L.: Adaptive cubic regularization methods for unconstrained optimization. Part II: worst-case function and derivative complexity. Math. Program. 130, 295\u2013319 (2011). \n                    https:\/\/doi.org\/10.1007\/s10107-009-0337-y","journal-title":"Math. Program."},{"key":"89_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/16M1106316","volume":"29","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Universal regularization methods: varying the power, the smoothness and the accuracy. SIAM. J. Optim. 29, 595\u2013615 (2019)","journal-title":"SIAM. J. Optim."},{"key":"89_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. Society for Industral and Applied Mathematics, Philadelphia (2000). \n                    https:\/\/doi.org\/10.1137\/1.9780898719857"},{"key":"89_CR13","volume-title":"Introduction to Calculus and Analysis","author":"R Courant","year":"1974","unstructured":"Courant, R., John, F.: Introduction to Calculus and Analysis. Wiley, New York (1974)"},{"key":"89_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust-region algorithm with a worst-case iteration complexity of \n                    \n                      \n                    \n                    $$O(\\varepsilon ^{-3\/2})$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            \u03b5\n                            \n                              -\n                              3\n                              \/\n                              2\n                            \n                          \n                          )\n                        \n                      \n                    \n                  . Math. Program. 162, 1\u201332 (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-016-1026-2","journal-title":"Math. Program."},{"key":"89_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/0801022","volume":"1","author":"JE Dennis Jr","year":"1991","unstructured":"Dennis Jr., J.E., Echebest, N., Guardarucci, M.T., Mart\u00ednez, J.M., Scolnik, H.D., Vacchino, C.: A curvilinear search using tridiagonal secant updates for unconstrained optimization. SIAM J. Optim. 1, 333\u2013357 (1991). \n                    https:\/\/doi.org\/10.1137\/0801022","journal-title":"SIAM J. Optim."},{"key":"89_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis Jr","year":"1996","unstructured":"Dennis Jr., J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Society for Industral and Applied Mathematics, Philadelphia (1996). \n                    https:\/\/doi.org\/10.1137\/1.9781611971200"},{"key":"89_CR17","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). \n                    https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"key":"89_CR18","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1322080","author":"JP Dussault","year":"2017","unstructured":"Dussault, J.P.: ARC\n                    \n                      \n                    \n                    $$_q$$\n                    \n                      \n                        \n                          \n                          q\n                        \n                      \n                    \n                  : a new adaptive regularization by cubics. Optim. Methods Softw. (2017). \n                    https:\/\/doi.org\/10.1080\/10556788.2017.1322080","journal-title":"Optim. Methods Softw."},{"key":"89_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"DM Gay","year":"1981","unstructured":"Gay, D.M.: Computing optimal locally constrained steps. SIAM J. Sci. Stat. Comput. 2, 186\u2013197 (1981). \n                    https:\/\/doi.org\/10.1137\/0902016","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"89_CR20","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"89_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-1-4613-3279-4_15","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"NIM Gould","year":"1998","unstructured":"Gould, N.I.M., Nocedal, J.: The modified absolute-value factorization norm for trust-region minimization. In: De Leone, R., Murli, A., Pardalos, P.M., Toraldo, G. (eds.) High Performance Algorithms and Software in Nonlinear Optimization, pp. 225\u2013241. Kluwer Academic Publishers, Dordrecht (1998). \n                    https:\/\/doi.org\/10.1007\/978-1-4613-3279-4_15"},{"key":"89_CR22","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2014","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2014). \n                    https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"key":"89_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-011-9446-7","volume":"53","author":"NIM Gould","year":"2012","unstructured":"Gould, N.I.M., Porcelli, M., Toint, P.L.: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53, 1\u201322 (2012). \n                    https:\/\/doi.org\/10.1007\/s10589-011-9446-7","journal-title":"Comput. Optim. Appl."},{"key":"89_CR24","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/16M1087801","volume":"27","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with H\u00f6lder continuous Hessians. SIAM J. Optim. 27, 478\u2013506 (2017). \n                    https:\/\/doi.org\/10.1137\/16M1087801","journal-title":"SIAM J. Optim."},{"unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms, technical report NA\/12. Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, England (1981)","key":"89_CR25"},{"key":"89_CR26","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newtons method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986). \n                    https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J. Numer. Anal."},{"key":"89_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2002)","edition":"2"},{"unstructured":"HSL. A collection of fortran codes for large scale scientific computation. \n                    http:\/\/www.hsl.rl.ac.uk\/","key":"89_CR28"},{"key":"89_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-014-9671-y","volume":"60","author":"EW Karas","year":"2015","unstructured":"Karas, E.W., Santos, S.A., Svaiter, B.F.: Algebraic rules for quadratic regularization of Newton\u2019s method. Comput. Optim. Appl. 60, 343\u2013376 (2015). \n                    https:\/\/doi.org\/10.1007\/s10589-014-9671-y","journal-title":"Comput. Optim. Appl."},{"key":"89_CR30","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10589-010-9363-1","volume":"51","author":"S Lu","year":"2012","unstructured":"Lu, S., Wei, Z., Li, L.: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput. Optim. Appl. 51, 551\u2013573 (2012). \n                    https:\/\/doi.org\/10.1007\/s10589-010-9363-1","journal-title":"Comput. Optim. Appl."},{"key":"89_CR31","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, 2447\u20132458 (2017). \n                    https:\/\/doi.org\/10.1137\/17M1115472","journal-title":"SIAM J. Optim."},{"key":"89_CR32","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68, 367\u2013385 (2017). \n                    https:\/\/doi.org\/10.1007\/s10898-016-0475-8","journal-title":"J. Glob. Optim."},{"key":"89_CR33","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983). \n                    https:\/\/doi.org\/10.1137\/0904038","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"89_CR34","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\u2019s method and its global performance. Math. Program. 108, 177\u2013205 (2006). \n                    https:\/\/doi.org\/10.1007\/s10107-006-0706-8","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization, technical report. \n                    arXiv:1706.03131v2\n                    \n                   [math.OC] (2017)","key":"89_CR35","DOI":"10.1137\/17M1134329"},{"key":"89_CR36","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00211-006-0021-6","volume":"104","author":"Z-H Wang","year":"2006","unstructured":"Wang, Z.-H., Yuan, Y.-X.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241\u2013269 (2006). \n                    https:\/\/doi.org\/10.1007\/s00211-006-0021-6","journal-title":"Numer. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00089-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00089-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00089-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:28:14Z","timestamp":1584664094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00089-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,21]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00089-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,3,21]]},"assertion":[{"value":"25 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}