{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:03Z","timestamp":1740145143805,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T00:00:00Z","timestamp":1688515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["2018-03865"],"award-info":[{"award-number":["2018-03865"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Agence Nationale pour la Recherche","award":["ANR-19-P3IA-0001"],"award-info":[{"award-number":["ANR-19-P3IA-0001"]}]},{"name":"France Canada Research Fund","award":["Improving Optimization Algorithms through Advanced Eigenvalue Approximation"],"award-info":[{"award-number":["Improving Optimization Algorithms through Advanced Eigenvalue Approximation"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s11590-023-02033-5","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T23:02:19Z","timestamp":1688511739000},"page":"1739-1756","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Detecting negative eigenvalues of exact and approximate Hessian matrices in optimization"],"prefix":"10.1007","volume":"17","author":[{"given":"Warren","family":"Hare","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2452-2172","authenticated-orcid":false,"given":"Cl\u00e9ment W.","family":"Royer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,5]]},"reference":[{"key":"2033_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01588294","volume":"18","author":"D Goldfarb","year":"1980","unstructured":"Goldfarb, D.: Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. 18, 31\u201340 (1980)","journal-title":"Math. Program."},{"key":"2033_CR2","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 step-size rule for negative curvature. Math. Program. 13, 111\u2013115 (1977)","journal-title":"Math. Program."},{"key":"2033_CR3","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":"2033_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28, 93\u2013108 (2012)","journal-title":"J. Complex."},{"key":"2033_CR5","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/s11590-018-1286-2","volume":"12","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Lubberts, Z., Robinson, D.P.: Concise complexity analyses for trust region methods. Optim. Lett. 12, 1713\u20131724 (2018)","journal-title":"Optim. Lett."},{"key":"2033_CR6","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim. 28, 1448\u20131477 (2018)","journal-title":"SIAM J. Optim."},{"key":"2033_CR7","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. SIAM, Philadelphia (2000)"},{"key":"2033_CR8","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":"2033_CR9","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering, Springer, Berlin (2017)"},{"key":"2033_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"2033_CR11","series-title":"Classics in Applied Mathematics","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, J.E., Jr., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Classics in Applied Mathematics, SIAM, Philadelphia (1996)"},{"key":"2033_CR12","unstructured":"Hare, W., Jarry-Bolduc, G., Planiden, C.: Hessian approximations. arXiv:2011.02584 (2020)"},{"key":"2033_CR13","unstructured":"Hare, W., Srivastava, K.: Applying complex-step derivative approximations in model-based derivative-free optimization. Technical Report (2020)"},{"key":"2033_CR14","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1080\/10556788.2013.808198","volume":"29","author":"MA Abramson","year":"2014","unstructured":"Abramson, M.A., Frimannslund, L., Steihaug, T.: A subclass of generating set search with convergence to second-order stationary points. Optim. Methods Softw. 29, 900\u2013918 (2014)","journal-title":"Optim. Methods Softw."},{"key":"2033_CR15","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J. Optim. 20, 387\u2013415 (2009)","journal-title":"SIAM J. Optim."},{"key":"2033_CR16","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1080\/02331934.2015.1124271","volume":"65","author":"S Gratton","year":"2016","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N.: A second-order globally convergent direct-search method and its worst-case complexity. Optimization 65, 1105\u20131128 (2016)","journal-title":"Optimization"},{"key":"2033_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-018-1328-7","volume":"179","author":"S Gratton","year":"2020","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N.: A decoupled first\/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds. Math. Program. 179, 195\u2013222 (2020)","journal-title":"Math. Program."},{"key":"2033_CR18","unstructured":"J\u00fadice, D.: Trust-region methods without using derivatives: worst case complexity and the non-smooth case. PhD thesis, Dept. Mathematics, Univ. Coimbra (2015)"},{"key":"2033_CR19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971163","volume-title":"The Symmetric Eigenvalue Problem","author":"BN Partlett","year":"1998","unstructured":"Partlett, B.N.: The Symmetric Eigenvalue Problem. Society for Industrial and Applied Mathematics, Philadelphia (1998)"},{"key":"2033_CR20","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"2033_CR21","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02033-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02033-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02033-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T08:21:22Z","timestamp":1695198082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02033-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,5]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["2033"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02033-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,7,5]]},"assertion":[{"value":"10 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}