{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:44:08Z","timestamp":1747485848277,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T00:00:00Z","timestamp":1600387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 Ca\u2019 Foscari Venezia"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we deal with Truncated Newton methods for solving large scale (possibly nonconvex) unconstrained optimization problems. In particular, we consider the use of a modified Bunch and Kaufman factorization for solving the Newton equation, at each (outer) iteration of the method. The Bunch and Kaufman factorization of a tridiagonal matrix is an effective and stable matrix decomposition, which is well exploited in the widely adopted SYMMBK\u00a0(Bunch and Kaufman in Math Comput 31:163\u2013179, 1977; Chandra in Conjugate gradient methods for partial differential equations, vol 129, 1978; Conn et al. in Trust-region methods. MPS-SIAM series on optimization, Society for Industrial Mathematics, Philadelphia, 2000; HSL, A collection of Fortran codes for large scale scientific computation, <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"http:\/\/www.hsl.rl.ac.uk\/\">http:\/\/www.hsl.rl.ac.uk\/<\/jats:ext-link>; Marcia in Appl Numer Math 58:449\u2013458, 2008) routine. It can be used to provide conjugate directions, both in the case of <jats:inline-formula><jats:alternatives><jats:tex-math>$$1\\times 1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mn>1<\/mml:mn>\n<mml:mo>\u00d7<\/mml:mo>\n<mml:mn>1<\/mml:mn>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$2\\times 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n<mml:mrow>\n<mml:mn>2<\/mml:mn>\n<mml:mo>\u00d7<\/mml:mo>\n<mml:mn>2<\/mml:mn>\n<\/mml:mrow>\n<\/mml:math><\/jats:alternatives><\/jats:inline-formula> pivoting steps. The main drawback is that the resulting solution of Newton\u2019s equation might not be gradient\u2013related, in the case the objective function is nonconvex. Here we first focus on some theoretical properties, in order to ensure that at each iteration of the Truncated Newton method, the search direction obtained by using an adapted Bunch and Kaufman factorization is gradient\u2013related. This allows to perform a standard Armijo-type linesearch procedure, using a bounded descent direction. Furthermore, the results of an extended numerical experience using large scale CUTEst problems is reported, showing the reliability and the efficiency of the proposed approach, both on convex and nonconvex problems.<\/jats:p>","DOI":"10.1007\/s10589-020-00225-8","type":"journal-article","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T03:50:56Z","timestamp":1600401056000},"page":"627-651","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton\u2019s equation"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0402-8732","authenticated-orcid":false,"given":"Andrea","family":"Caliciotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4721-8114","authenticated-orcid":false,"given":"Giovanni","family":"Fasano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Potra","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":[[2020,9,18]]},"reference":[{"key":"225_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971538","volume-title":"Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods","author":"R Barret","year":"1994","unstructured":"Barret, R., Berry, M., Chan, T., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., Van der Vorst, H.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, PA (1994)"},{"key":"225_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1090\/S0025-5718-1977-0428694-0","volume":"31","author":"J Bunch","year":"1977","unstructured":"Bunch, J., Kaufman, L.: Some stable methods for calculating inertia and solving symmetric linear equations. Math. Comput. 31, 163\u2013179 (1977)","journal-title":"Math. Comput."},{"key":"225_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.orl.2017.10.014","volume":"46","author":"A Caliciotti","year":"2018","unstructured":"Caliciotti, A., Fasano, G., Nash, S.G., Roma, M.: An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization. Oper. Res. Lett. 46, 7\u201312 (2018)","journal-title":"Oper. Res. Lett."},{"key":"225_CR4","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dib.2018.01.012","volume":"17","author":"A Caliciotti","year":"2018","unstructured":"Caliciotti, A., Fasano, G., Nash, S.G., Roma, M.: Data and performance profiles applying an adaptive truncation criterion, within linesearch-based truncated Newton methods, in large scale nonconvex optimization. Data Brief 17, 246\u2013255 (2018)","journal-title":"Data Brief"},{"key":"225_CR5","unstructured":"Chandra, R.: Conjugate gradient methods for partial differential equations, Ph.D. thesis, Yale University, New Haven. Research Report 129 (1978)"},{"key":"225_CR6","volume-title":"Trust-Region Methods. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. Society for Industrial Mathematics, Philadelphia (2000)"},{"key":"225_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10589-017-9957-y","volume":"71","author":"R De Leone","year":"2018","unstructured":"De Leone, R., Fasano, G., Sergeyev, Y.: Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming. Comput. Optim. Appl. 71, 73\u201393 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"225_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"R Dembo","year":"1982","unstructured":"Dembo, R., Eisenstat, S., Steihaug, T.: Inexact Newton methods. SIAM J. Numer. Anal. 19, 400\u2013408 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"225_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"R Dembo","year":"1983","unstructured":"Dembo, R., Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26, 190\u2013212 (1983)","journal-title":"Math. Program."},{"key":"225_CR10","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":"225_CR11","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":"225_CR12","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":"225_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10957-006-9119-3","volume":"132","author":"G Fasano","year":"2006","unstructured":"Fasano, G.: Lanczos-conjugate gradient method and pseudoinverse computation, in unconstrained optimization. J. Optim. Theory Appl. 132, 267\u2013285 (2006)","journal-title":"J. Optim. Theory Appl."},{"key":"225_CR14","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":"225_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10589-013-9563-6","volume":"56","author":"G Fasano","year":"2013","unstructured":"Fasano, G., Roma, M.: Preconditioning Newton\u2013Krylov methods in nonconvex large scale optimization. Comput. Optim. Appl. 56, 253\u2013290 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"225_CR16","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":"225_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970937","volume-title":"Iterative Methods for Solving Linear Systems","author":"A Greenbaum","year":"1997","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems. SIAM, Philadelphia (1997)"},{"key":"225_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone linesearch for unconstrained optimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"225_CR19","unstructured":"HSL, A collection of Fortran codes for large scale scientific computation. http:\/\/www.hsl.rl.ac.uk\/"},{"key":"225_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.apnum.2007.01.014","volume":"58","author":"R Marcia","year":"2008","unstructured":"Marcia, R.: On solving sparse symmetric linear systems whose definiteness is unknown. Appl. Numer. Math. 58, 449\u2013458 (2008)","journal-title":"Appl. Numer. Math."},{"key":"225_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0377-0427(00)00426-X","volume":"124","author":"S Nash","year":"2000","unstructured":"Nash, S.: A survey of truncated-Newton methods. J. Comput. Appl. Math. 124, 45\u201359 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"225_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6377(90)90065-D","volume":"9","author":"S Nash","year":"1990","unstructured":"Nash, S., Sofer, A.: Assessing a search direction within a truncated-Newton method. Oper. Res. Lett. 9, 219\u2013221 (1990)","journal-title":"Oper. Res. Lett."},{"key":"225_CR23","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"225_CR24","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/978-3-642-68874-4_21","volume-title":"Mathematical Programming. The State of the Art","author":"J Stoer","year":"1983","unstructured":"Stoer, J.: Solution of large linear systems of equations by conjugate gradient type methods. In: Bachem, A., Gr\u00f6tschel, M., Korte, B. (eds.) Mathematical Programming. The State of the Art, pp. 540\u2013565. Springer, Berlin (1983)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00225-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00225-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00225-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:42:45Z","timestamp":1631925765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00225-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,18]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00225-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,9,18]]},"assertion":[{"value":"3 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}