{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:57:16Z","timestamp":1759838236492,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00186-017-0593-1","type":"journal-article","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:49:32Z","timestamp":1496278172000},"page":"501-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Exploiting damped techniques for nonlinear conjugate gradient methods"],"prefix":"10.1007","volume":"86","author":[{"given":"Mehiddin","family":"Al-Baali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Caliciotti","sequence":"additional","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":"Massimo","family":"Roma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,1]]},"reference":[{"key":"593_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/imanum\/5.1.121","volume":"5","author":"M Al-Baali","year":"1985","unstructured":"Al-Baali M (1985) Descent property and global convergence of the Fletcher\u2013Reeves method with inexact line search. IMA J Numer Anal 5:121\u2013124","journal-title":"IMA J Numer Anal"},{"key":"593_CR2","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1080\/10556788.2014.891030","volume":"29","author":"M Al-Baali","year":"2014","unstructured":"Al-Baali M (2014) Damped techniques for enforcing convergence of quasi-Newton methods. Optim Methods Softw 29:919\u2013936","journal-title":"Optim Methods Softw"},{"key":"593_CR3","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/S1064827591194303","volume":"17","author":"M Al-Baali","year":"1996","unstructured":"Al-Baali M, Fletcher R (1996) On the order of convergence of preconditioned nonlinear conjugate gradient methods. SIAM J Sci Comput 17:658\u2013665","journal-title":"SIAM J Sci Comput"},{"key":"593_CR4","first-page":"63","volume":"11","author":"M Al-Baali","year":"2009","unstructured":"Al-Baali M, Grandinetti L (2009) On practical modifications of the quasi-Newton BFGS methods. AMO Adv Model Optim 11:63\u201376","journal-title":"AMO Adv Model Optim"},{"key":"593_CR5","unstructured":"Al-Baali M, Grandinetti L (2017) Improved damped quasi-Newton methods for unconstrained optimization. Pacific J Optim (to appear)"},{"key":"593_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.24200\/squjs.vol17iss1pp1-11","volume":"17","author":"M Al-Baali","year":"2012","unstructured":"Al-Baali M, Purnama A (2012) Numerical experience with damped quasi-Newton optimization methods when the objective function is quadratic. SQU J Sci 17:1\u201311","journal-title":"SQU J Sci"},{"key":"593_CR7","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/s10957-013-0448-8","volume":"161","author":"M Al-Baali","year":"2014","unstructured":"Al-Baali M, Grandinetti L, Pisacane O (2014a) Damped techniques for the limited memory BFGS method for large-scale optimization. J Optim Theory Appl 161:688\u2013699","journal-title":"J Optim Theory Appl"},{"key":"593_CR8","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1080\/10556788.2013.856909","volume":"29","author":"M Al-Baali","year":"2014","unstructured":"Al-Baali M, Spedicato E, Maggioni F (2014b) Broyden\u2019s quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems. Optim Methods Softw 29:937\u2013954","journal-title":"Optim Methods Softw"},{"key":"593_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, New York"},{"key":"593_CR10","unstructured":"Caliciotti A, Fasano G, Roma M (2016) Preconditioning strategies for nonlinear conjugate gradient methods, based on quasi-Newton updates. In: Sergeyev Y, Kvasov D, Dell\u2019Accio F, Mukhametzhanov M (eds) AIP conference proceedings, vol 1776. American Institute of Physics"},{"key":"593_CR11","doi-asserted-by":"crossref","unstructured":"Caliciotti A, Fasano G, Roma M (2017a) Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods. Optim Lett 11:835\u2013853","DOI":"10.1007\/s11590-016-1060-2"},{"key":"593_CR12","doi-asserted-by":"crossref","unstructured":"Caliciotti A, Fasano G, Roma M (2017b) Preconditioned nonlinear conjugate gradient methods based on a modified secant equation. Appl Math Comput (submitted to)","DOI":"10.1016\/j.amc.2017.08.029"},{"key":"593_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 J (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"key":"593_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10589-013-9563-6","volume":"56","author":"G Fasano","year":"2013","unstructured":"Fasano G, Roma M (2013) Preconditioning Newton\u2013Krylov methods in nonconvex large scale optimization. Comput Optim Appl 56:253\u2013290","journal-title":"Comput Optim Appl"},{"key":"593_CR15","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10589-015-9765-1","volume":"65","author":"G Fasano","year":"2016","unstructured":"Fasano G, Roma M (2016) A novel class of approximate inverse preconditioners for large scale positive definite linear systems in optimization. Comput Optim Appl 65:399\u2013429","journal-title":"Comput Optim Appl"},{"key":"593_CR16","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical methods of optimization. Wiley, New York"},{"key":"593_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J Gilbert","year":"1992","unstructured":"Gilbert J, Nocedal J (1992) Global convergence properties of conjugate gradient methods for optimization. SIAM J Optim 2:21\u201342","journal-title":"SIAM J Optim"},{"key":"593_CR18","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould NIM, Orban D, Toint PL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads. Comput Optim Appl 60:545\u2013557","journal-title":"Comput Optim Appl"},{"key":"593_CR19","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1137\/08074008","volume":"21","author":"S Gratton","year":"2011","unstructured":"Gratton S, Sartenaer A, Tshimanga J (2011) On a class of limited memory preconditioners for large scale linear systems with multiple right-hand sides. SIAM J Optim 21:912\u2013935","journal-title":"SIAM J Optim"},{"key":"593_CR20","first-page":"375","volume":"78","author":"L Grippo","year":"1997","unstructured":"Grippo L, Lucidi S (1997) A globally convergent version of Polak\u2013Ribi\u00e8re conjugate gradient method. Math Program 78:375\u2013391","journal-title":"Math Program"},{"key":"593_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/1055678042000208570","volume":"20","author":"L Grippo","year":"2005","unstructured":"Grippo L, Lucidi S (2005) Convergence conditions, line search algorithms and trust region implementations for the Polak\u2013Ribi\u00e8re conjugate gradient method. Optim Methods Softw 20:71\u201398","journal-title":"Optim Methods Softw"},{"key":"593_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-88-470-1794-8","volume-title":"Metodi di ottimizzazione non vincolata","author":"L Grippo","year":"2011","unstructured":"Grippo L, Sciandrone M (2011) Metodi di ottimizzazione non vincolata. Springer, Milan"},{"key":"593_CR23","doi-asserted-by":"crossref","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"W Hager","year":"2013","unstructured":"Hager W, Zhang H (2013) The limited memory conjugate gradient method. SIAM J Optim 23:2150\u20132168","journal-title":"SIAM J Optim"},{"key":"593_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative methods for optimization. Frontiers in applied mathematics","author":"CT Kelley","year":"1999","unstructured":"Kelley CT (1999) Iterative methods for optimization. Frontiers in applied mathematics. SIAM, Philadelphia, PA"},{"key":"593_CR25","doi-asserted-by":"crossref","first-page":"1079","DOI":"10.1137\/S1052623497327854","volume":"10","author":"J Morales","year":"2000","unstructured":"Morales J, Nocedal J (2000) Automatic preconditioning by limited memory quasi-Newton updating. SIAM J Optim 10:1079\u20131096","journal-title":"SIAM J Optim"},{"key":"593_CR26","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"J Mor\u00e9","year":"1994","unstructured":"Mor\u00e9 J, Thuente D (1994) Line search algorithms with guaranteed sufficient decrease. ACM Trans Math Softw (TOMS) 20:286\u2013307","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"593_CR27","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright S (2006) Numerical optimization, 2nd edn. Springer, New York","edition":"2"},{"key":"593_CR28","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01588967","volume":"14","author":"MJD Powell","year":"1978","unstructured":"Powell MJD (1978) Algorithms for nonlinear constraints that use Lagrangian functions. Math Program 14:224\u2013248","journal-title":"Math Program"},{"key":"593_CR29","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF01582161","volume":"34","author":"MJD Powell","year":"1986","unstructured":"Powell MJD (1986) How bad are the BFGS and DFP methods when the objective function is quadratic? Math Program 34:34\u201347","journal-title":"Math Program"},{"key":"593_CR30","volume-title":"Conjugate gradient algorithms in nonconvex optimization","author":"R Pytlak","year":"2009","unstructured":"Pytlak R (2009) Conjugate gradient algorithms in nonconvex optimization. Springer, Berlin"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-017-0593-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-017-0593-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-017-0593-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:34:42Z","timestamp":1569393282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-017-0593-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s00186-017-0593-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2017,6,1]]}}}