{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T09:33:30Z","timestamp":1673516010830},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T00:00:00Z","timestamp":1597104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s40314-020-01297-2","type":"journal-article","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T13:03:48Z","timestamp":1597151028000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-step conjugate gradient method for unconstrained optimization"],"prefix":"10.1007","volume":"39","author":[{"given":"R.","family":"Dehghani","sequence":"first","affiliation":[]},{"given":"N.","family":"Bidabadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"1297_CR1","doi-asserted-by":"publisher","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- Reeves method with inexact linesearch. IMA J. Numer. Anal. 5:121\u2013124","journal-title":"IMA J. Numer. Anal."},{"key":"1297_CR2","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","volume":"234","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S, Ghanbari R (2014) The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices. Eur. J. Oper. Res. 234:625\u2013630","journal-title":"Eur. J. Oper. Res."},{"key":"1297_CR3","doi-asserted-by":"publisher","first-page":"1374","DOI":"10.1016\/j.cam.2010.01.052","volume":"234","author":"S Babaie-Kafaki","year":"2010","unstructured":"Babaie-Kafaki S, Ghanbari R, Mahdavi-Amiri N (2010) Two new conjugate gradient methods based on modified secant relations. J. Comput. Appl. Math. 234:1374\u20131386","journal-title":"J. Comput. Appl. Math."},{"key":"1297_CR4","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Han JY, Liu GH, Sun DF, Yin HX, Yuan YX (1999) Convergence properties of nonlinear conjugate gradient methods. SIAM J. Optim. 10:348\u2013358","journal-title":"SIAM J. Optim."},{"key":"1297_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai YH, Liao LZ (2001) New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43:87\u2013101","journal-title":"Appl. Math. Optim."},{"key":"1297_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math. Program. 91:201\u2013213","journal-title":"Math. Program."},{"key":"1297_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher R, Revees CM (1964) Function minimization by conjugate gradients. Comput. J. 7:149\u2013154","journal-title":"Comput. J."},{"key":"1297_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0377-0427(97)00075-7","volume":"82","author":"JA Ford","year":"1997","unstructured":"Ford JA, Moghrabi IA (1997) Alternating multi-step quasi-Newton methods for unconstrained optimization. J. Comput. Appl. Math. 82:105\u2013116","journal-title":"J. Comput. Appl. Math."},{"key":"1297_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1080\/10556789308805550","volume":"2","author":"JA Ford","year":"1993","unstructured":"Ford JA, Moghrabi IA (1993) Alternative parameter choices for multi-step quasi-Newton methods. Optim. Methods Softw. 2:357\u2013370","journal-title":"Optim. Methods Softw."},{"key":"1297_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0377-0427(94)90309-3","volume":"50","author":"JA Ford","year":"1994","unstructured":"Ford JA, Moghrabi IA (1994) Multi-step quasi-Newton methods for optimization. J. Comput. Appl. Math. 50:305\u2013323","journal-title":"J. Comput. Appl. Math."},{"key":"1297_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10589-007-9087-z","volume":"40","author":"JA Ford","year":"2008","unstructured":"Ford JA, Narushima Y, Yabe H (2008) Multi-step nonlinear conjugate gradient methods for unconstrained minimization. Comput. Opt. Appl. 40:191\u2013216 21-42 (1992)","journal-title":"Comput. Opt. Appl."},{"key":"1297_CR12","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould NI, Orban D, Toint PhL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Opt. Appl. 60:545\u2013557","journal-title":"Comput. Opt. Appl."},{"key":"1297_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes MR, Stiefel EL (1952) Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49:409\u2013436","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"1297_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.cam.2006.03.005","volume":"202","author":"G Li","year":"2007","unstructured":"Li G, Tang C, Wei Z (2007) New conjugacy condition and related new conjugate gradient methods for unconstrained optimization. J. Comput. Appl. Math. 202:523\u2013539","journal-title":"J. Comput. Appl. Math."},{"key":"1297_CR15","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/192115.192132","volume":"20","author":"JJ Mor\u00e9","year":"1994","unstructured":"Mor\u00e9 JJ, Thuente DJ (1994) Line search algorithms with guaranteed sufficient decrease. ACM Trans. Math. Softw. 20:286\u2013307","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"1297_CR16","first-page":"1","volume":"49","author":"IA Moghrabi","year":"2019","unstructured":"Moghrabi IA (2019) A new preconditioned conjugate gradient method for optimization. IAENG Int. J. Appl. Math. 49(1):1\u20138","journal-title":"IAENG Int. J. Appl. Math."},{"key":"1297_CR17","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical Optimization. Springer, New York"},{"key":"1297_CR18","first-page":"35","volume":"16","author":"E Polak","year":"1969","unstructured":"Polak E, Ribi\u00e9re G (1969) Note Sur la Convergence de Directions Conjugu\u00e9e. Francaise Informat Recherche Operationelle 16:35\u201343","journal-title":"Francaise Informat Recherche Operationelle"},{"key":"1297_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak BT (1969) The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9:94\u2013112","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1297_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"2","author":"MJD Powell","year":"1977","unstructured":"Powell MJD (1977) Restart procedures of the conjugate gradient method. Math. Program. 2:241\u2013254","journal-title":"Math. Program."},{"key":"1297_CR21","first-page":"122","volume-title":"Nonconvex minimization calculations and the conjugate gradient method, Numerical Analysis (Dundee, 1983) Lecture Notes in Mathematics","author":"MJD Powell","year":"1984","unstructured":"Powell MJD (1984) Nonconvex minimization calculations and the conjugate gradient method, Numerical Analysis (Dundee, 1983) Lecture Notes in Mathematics, vol 1066. Springer, Berlin, pp 122\u2013141"},{"key":"1297_CR22","first-page":"1156","volume":"175","author":"Z Wei","year":"2006","unstructured":"Wei Z, Li G, Qi L (2006) New quasi-Newton methods for unconstrained optimization problems. Appl. Math. Comput. 175:1156\u20131188","journal-title":"Appl. Math. Comput."},{"key":"1297_CR23","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10589-008-9219-0","volume":"47","author":"G Yuan","year":"2010","unstructured":"Yuan G, Wei Z (2010) Convergence analysis of a modified BFGS method on convex minimizations. Comput. Opt. Appl. 47:237\u2013255","journal-title":"Comput. Opt. Appl."},{"key":"1297_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/B:COAP.0000026885.81997.88","volume":"28","author":"H Yabe","year":"2004","unstructured":"Yabe H, Takano M (2004) Global convergence properties of nonlinear conjugate gradient methods with modified secant relation. Comput. Optim. Appl. 28:203\u2013225","journal-title":"Comput. Optim. Appl."},{"key":"1297_CR25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0377-0427(00)00713-5","volume":"137","author":"JZ Zhang","year":"2001","unstructured":"Zhang JZ, Xu CX (2001) Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equation. J. Comput. Appl. Math. 137:269\u2013278","journal-title":"J. Comput. Appl. Math."},{"key":"1297_CR26","first-page":"37","volume-title":"Integer and nonlinear programming","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk G (1970) Nonlinear programming, computational methods. In: Abadie J (ed) Integer and nonlinear programming. North-holland, Amsterdam, pp 37\u201386"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01297-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01297-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01297-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:42:11Z","timestamp":1628638931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01297-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,11]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1297"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01297-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,11]]},"assertion":[{"value":"15 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"241"}}