{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T13:10:05Z","timestamp":1747487405103,"version":"3.40.5"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T00:00:00Z","timestamp":1738972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 degli Studi di Roma La Sapienza"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we consider the issue of computing negative curvature directions, for nonconvex functions, within Newton\u2013Krylov methods for large scale unconstrained optimization. In the last decades this issue has been widely investigated in the literature, and different approaches have been proposed. We focus on the well known SYMMBK method introduced for solving large scale symmetric possibly indefinite linear systems\u00a0(Bunch and Kaufman in Math Comput 31:163\u2013179, 2003; Chandra in Conjugate gradient methods for partial differential equations, Yale University, New Haven, 1978; Conn et al. Trust-region methods. MPS-SIAM Series on Optimization, Philadelphia, 2000; HSL 2013: A collection of Fortran codes for large scale scientific computation. <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"http:\/\/www.hsl.rl.ac.uk\/\" ext-link-type=\"uri\">http:\/\/www.hsl.rl.ac.uk\/<\/jats:ext-link>), and show how to exploit it to yield an effective negative curvature direction in optimization frameworks. The distinguishing feature of our proposal is that the computation of negative curvatures is basically carried out as by\u2013product of SYMMBK procedure, without storing no more than two additional vectors. Hence, no explicit matrix factorization or matrix storage is required. An extensive numerical experimentation has been performed on  problems; the obtained results have been analyzed also through novel profiles (<jats:italic>Quality Profiles<\/jats:italic>) which highlighted the good capability of the algorithms which use negative curvature directions to determine better local minimizers.<\/jats:p>","DOI":"10.1007\/s10589-025-00650-7","type":"journal-article","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T09:32:42Z","timestamp":1739007162000},"page":"617-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton\u2013Krylov methods"],"prefix":"10.1007","volume":"91","author":[{"given":"Giovanni","family":"Fasano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Piermarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9858-3616","authenticated-orcid":false,"given":"Massimo","family":"Roma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,8]]},"reference":[{"key":"650_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-009-0305-6","volume":"128","author":"CP Avelino","year":"2011","unstructured":"Avelino, C.P., Moguerza, J.M., Olivares, A., Prieto, F.J.: Combining and scaling descent and negative curvature directions. Math. Program. 128, 285\u2013319 (2011)","journal-title":"Math. Program."},{"key":"650_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0893-6080(89)90014-2","volume":"2","author":"P Baldi","year":"1989","unstructured":"Baldi, P., Hornik, K.: Neural networks and principal component analysis: learning from examples without local minima. Neural Netw. 2, 53\u201358 (1989)","journal-title":"Neural Netw."},{"key":"650_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"650_CR4","doi-asserted-by":"publisher","first-page":"150201","DOI":"10.1103\/PhysRevLett.98.150201","volume":"98","author":"AJ Bray","year":"2007","unstructured":"Bray, A.J., Dean, D.S.: Statistics of critical points of Gaussian fields on large-dimensional spaces. Phys. Rev. Lett. 98, 150201 (2007)","journal-title":"Phys. Rev. Lett."},{"key":"650_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1090\/S0025-5718-1977-0428694-0","volume":"31","author":"JR Bunch","year":"1977","unstructured":"Bunch, J.R., Kaufman, L.C.: Some stable methods for calculating inertia and solving symmetric linear equations. Math. Comput. 31, 163\u2013179 (1977)","journal-title":"Math. Comput."},{"key":"650_CR6","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10589-020-00225-8","volume":"77","author":"A Caliciotti","year":"2020","unstructured":"Caliciotti, A., Fasano, G., Potra, F., Roma, M.: Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton\u2019s equation. Comput. Optim. Appl. 77, 627\u2013651 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"650_CR7","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s11590-016-1060-2","volume":"11","author":"A Caliciotti","year":"2017","unstructured":"Caliciotti, A., Fasano, G., Roma, M.: Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods. Optim. Lett. 11, 835\u2013853 (2017)","journal-title":"Optim. Lett."},{"key":"650_CR8","first-page":"196","volume":"318","author":"A Caliciotti","year":"2018","unstructured":"Caliciotti, A., Fasano, G., Roma, M.: Preconditioned nonlinear conjugate gradient methods based on a modified secant equation. Appl. Math. Comput. 318, 196\u2013214 (2018)","journal-title":"Appl. Math. Comput."},{"key":"650_CR9","unstructured":"Chandra, R.: Conjugate gradient methods for partial differential equations. PhD Thesis, Yale University, New Haven (1978). Research Report 129"},{"key":"650_CR10","unstructured":"Choromanska, A., Henaff, M., Mathieu, M., Arous, G.B., LeCun, Y.: The loss surfaces of multilayer networks. In: Artificial Intelligence and Statistics, pp. 192\u2013204 (2015). PMLR"},{"key":"650_CR11","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-region methods. MPS-SIAM Series on Optimization, Philadelphia (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"650_CR12","volume-title":"Lanczos Algorithms for Large Symmetric Eigenvalue Computations","author":"JK Cullum","year":"1985","unstructured":"Cullum, J.K., Willoughby, R.A.: Lanczos Algorithms for Large Symmetric Eigenvalue Computations. Birkhauser, Boston (1985)"},{"key":"650_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1335-8","volume":"176","author":"FE Curtis","year":"2019","unstructured":"Curtis, F.E., Robinson, D.P.: Exploiting negative curvature in deterministic and stochastic optimization. Math. Program. 176, 69\u201394 (2019)","journal-title":"Math. Program."},{"key":"650_CR14","unstructured":"Dauphin, Y.N., Pascanu, R., Gulcehre, C., Cho, K., Ganguli, S., Bengio, Y.: Identifying and attacking the saddle point problem in high-dimensional non-convex optimization. Adv. Neural Inf. Process. Syst. 27 (2014)"},{"key":"650_CR15","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10957-020-01717-7","volume":"186","author":"R De Leone","year":"2020","unstructured":"De Leone, R., Fasano, G., Roma, M., Sergeyev, Y.D.: Iterative grossone-based computation of negative curvature directions in large-scale optimization. J. Optim. Theory Appl. 186, 554\u2013589 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"650_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Numer. Anal. 19, 400\u2013408 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"650_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"RS Dembo","year":"1983","unstructured":"Dembo, R.S., Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26, 190\u2013212 (1983)","journal-title":"Math. Program."},{"key":"650_CR18","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.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"650_CR19","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10957-005-2087-1","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar-conjugate gradient algorithm for large-scale unconstrained optimization, part 1: theory. J. Optim. Theory Appl. 125, 523\u2013541 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"650_CR20","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10957-005-2088-0","volume":"125","author":"G Fasano","year":"2005","unstructured":"Fasano, G.: Planar-conjugate gradient algorithm for large-scale unconstrained optimization, part 2: application. J. Optim. Theory Appl. 125, 543\u2013558 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"650_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11590-009-0132-y","volume":"3","author":"G Fasano","year":"2009","unstructured":"Fasano, G., Lucidi, S.: A nonmonotone truncated Newton\u2013Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3, 521\u2013535 (2009)","journal-title":"Optim. Lett."},{"key":"650_CR22","unstructured":"Fasano, G., Piermarini, C., Roma, M.: Exploiting SYMMBK method for the full computation of negative curvature directions. Technical Report 06-2023, Dipartimento di Ingegneria Informatica, Automatica e Gestionale \u201cA. Ruberti\u201d, SAPIENZA Universit\u00e0 di Roma (2023). https:\/\/www.diag.uniroma1.it\/biblio_diag\/sites\/default\/files\/techreports\/2023_06_0.pdf"},{"key":"650_CR23","doi-asserted-by":"crossref","unstructured":"Fasano, G., Piermarini, C., Roma, M.: Bridging the gap between trust\u2013region methods (TRMs) and linesearch based methods (LBMs) for nonlinear programming: quadratic sub\u2013problems. Department of Management, Universit\u00e0 Ca\u2019 Foscari Venezia, Working Paper 8 (2022)","DOI":"10.2139\/ssrn.4154641"},{"key":"650_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10589-007-9034-z","volume":"38","author":"G Fasano","year":"2007","unstructured":"Fasano, G., Roma, M.: Iterative computation of negative curvature directions in large scale optimization. Comput. Optim. Appl. 38, 81\u2013104 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"650_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF00249642","volume":"6","author":"MC Ferris","year":"1996","unstructured":"Ferris, M.C., Lucidi, S., Roma, M.: Nonmonotone curvilinear linesearch methods for unconstrained optimization. Comput. Optim. Appl. 6, 117\u2013136 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"650_CR26","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556780008805794","volume":"14","author":"NIM Gould","year":"2000","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, P.L.: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optim. Methods Softw. 14, 75\u201398 (2000)","journal-title":"Optim. Methods Softw."},{"key":"650_CR27","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"650_CR28","unstructured":"HSL 2013: A collection of Fortran codes for large scale scientific computation. http:\/\/www.hsl.rl.ac.uk\/"},{"key":"650_CR29","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10589-018-0002-6","volume":"70","author":"H Jiang","year":"2018","unstructured":"Jiang, H., Robinson, D.P., Vidal, R., You, C.: A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis. Comput. Optim. Appl. 70, 395\u2013418 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"650_CR30","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1137\/S1052623495295250","volume":"8","author":"S Lucidi","year":"1998","unstructured":"Lucidi, S., Rochetich, F., Roma, M.: Curvilinear stabilization techniques for truncated Newton methods in large scale unconstrained optimization. SIAM J. Optim. 8, 916\u2013939 (1998)","journal-title":"SIAM J. Optim."},{"key":"650_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01584328","volume":"13","author":"GP McCormick","year":"1977","unstructured":"McCormick, G.P.: A modification of Armijo\u2019s step-size rule for negative curvature. Math. Program. 13, 111\u2013115 (1977)","journal-title":"Math. Program."},{"key":"650_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582091","volume":"16","author":"JJ Mor\u00e9","year":"1979","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: On the use of directions of negative curvature in a modified Newton method. Math. Program. 16, 1\u201320 (1979)","journal-title":"Math. Program."},{"key":"650_CR33","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0377-0427(00)00426-X","volume":"124","author":"SG Nash","year":"2000","unstructured":"Nash, S.G.: A survey of truncated-Newton methods. J. Comput. Appl. Math. 124, 45\u201359 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"650_CR34","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0721052","volume":"21","author":"SG Nash","year":"1984","unstructured":"Nash, S.G.: Newton-type minimization via the Lanczos method. SIAM J. Numer. Anal. 21, 770\u2013788 (1984)","journal-title":"SIAM J. Numer. Anal."},{"key":"650_CR35","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.ejor.2006.09.097","volume":"189","author":"A Olivares","year":"2008","unstructured":"Olivares, A., Moguerza, J.M., Prieto, F.J.: Nonconvex optimization using negative curvature within a modified linesearch. Eur. J. Oper. Res. 189, 706\u2013722 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"650_CR36","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"S Wild","year":"2009","unstructured":"Wild, S., Mor\u00e9, J.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00650-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00650-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00650-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:32:05Z","timestamp":1747485125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00650-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,8]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00650-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,2,8]]},"assertion":[{"value":"2 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","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 have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}