{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:54:41Z","timestamp":1740142481689,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["No. 11901561"],"award-info":[{"award-number":["No. 11901561"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"GuangXi Science Foundation","award":["No. 2018GXNSFBA281180"],"award-info":[{"award-number":["No. 2018GXNSFBA281180"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M660833"],"award-info":[{"award-number":["2019M660833"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s40314-020-01301-9","type":"journal-article","created":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T16:52:40Z","timestamp":1597769560000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization"],"prefix":"10.1007","volume":"39","author":[{"given":"Xinliu","family":"Diao","sequence":"first","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zexian","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"1301_CR1","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei N (2008) An unconstrained optimization test functions collection. Adv Model Optim 10:147\u2013161","journal-title":"Adv Model Optim"},{"issue":"4","key":"1301_CR2","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s11075-013-9718-7","volume":"65","author":"N Andrei","year":"2014","unstructured":"Andrei N (2014) An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. Numer Algorithms 65(4):859\u2013874","journal-title":"Numer Algorithms"},{"issue":"4","key":"1301_CR3","doi-asserted-by":"publisher","first-page":"1350092","DOI":"10.1142\/S0219876213500928","volume":"11","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S (2014) An adaptive conjugacy condition and related nonlinear conjugate gradient methods. Int J Comput Methods 11(4):1350092","journal-title":"Int J Comput Methods"},{"issue":"3","key":"1301_CR4","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, Reza G (2014) The Dai\u2013Liao nonlinear conjugate gradient method with optimal parameter choices. Eur J Oper Res 234(3):625\u2013630","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1301_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IAM J Numer Anal 8(1):141\u2013148","journal-title":"IAM J Numer Anal"},{"issue":"4","key":"1301_CR6","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1137\/040611951","volume":"44","author":"S Bellavia","year":"2006","unstructured":"Bellavia S, Morini B (2006) Subspace trust-region methods for large bound-constrained nonlinear equations. SIAM J Numer Anal 44(4):1535\u20131555","journal-title":"SIAM J Numer Anal"},{"issue":"8","key":"1301_CR7","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1016\/j.cam.2010.10.041","volume":"235","author":"F Biglari","year":"2011","unstructured":"Biglari F, Hassan MA, Leong WJ (2011) New quasi-Newton methods via higher order tensor models. J Comput Appl Math 235(8):2412\u20132422","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1301_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai YH, Kou CX (2013) A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J Optim 23(1):296\u2013320","journal-title":"SIAM J Optim"},{"issue":"8","key":"1301_CR9","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s11425-016-0279-2","volume":"59","author":"YH Dai","year":"2016","unstructured":"Dai YH, Kou CX (2016) A Barzilai\u2013Borwein conjugate gradient method. Sci China Math 59(8):1511\u20131524","journal-title":"Sci China Math"},{"issue":"1","key":"1301_CR10","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(1):87\u2013101","journal-title":"Appl Math Optim"},{"issue":"1","key":"1301_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Yuan YX (1999) A nonlinear conjugate gradient method with a strong global convergence property. SIAM J Optim 10(1):177\u2013182","journal-title":"SIAM J Optim"},{"issue":"2","key":"1301_CR12","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(2):201\u2013213","journal-title":"Math Program"},{"issue":"3","key":"1301_CR13","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1137\/08072440X","volume":"20","author":"JB Erway","year":"2009","unstructured":"Erway JB, Gill PE (2009) A subspace minimization method for the trust-region step. SIAM J Optim 20(3):1439\u20131461","journal-title":"SIAM J Optim"},{"key":"1301_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cam.2015.12.035","volume":"300","author":"M Fatemi","year":"2016","unstructured":"Fatemi M (2016) A new efficient conjugate gradient method for uncontrained optimization. J Comput Appl Math 300:207\u2013216","journal-title":"J Comput Appl Math"},{"issue":"2","key":"1301_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher R, Reeves CM (1964) Function minimization by conjugate gradients. Comput J 7(2):149\u2013154","journal-title":"Comput J"},{"issue":"4","key":"1301_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould NIM, Orban D, Toint PhL (2003) CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans Math Softw 29(4):373\u2013394","journal-title":"ACM Trans Math Softw"},{"issue":"1","key":"1301_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager WW, Zhang HC (2005) A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim 16(1):170\u2013192","journal-title":"SIAM J Optim"},{"issue":"4","key":"1301_CR18","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"WW Hager","year":"2013","unstructured":"Hager WW, Zhang HC (2013) The limited memory conjugate gradient method. SIAM J Optim 23(4):2150\u20132168","journal-title":"SIAM J Optim"},{"issue":"6","key":"1301_CR19","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 Natl Bur Stand 49(6):409\u2013436","journal-title":"J Res Natl Bur Stand"},{"issue":"1","key":"1301_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11075-017-0434-6","volume":"79","author":"M Li","year":"2018","unstructured":"Li M, Liu HW, Liu ZX (2018) A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization. Numer Algorithms 79(1):195\u2013219","journal-title":"Numer Algorithms"},{"issue":"1","key":"1301_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11075-017-0365-2","volume":"78","author":"ZX Liu","year":"2018","unstructured":"Liu ZX, Liu HW (2018) An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization. Numer Algorithms 78(1):21\u201339","journal-title":"Numer Algorithms"},{"issue":"3","key":"1301_CR22","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10957-018-1393-3","volume":"180","author":"HW Liu","year":"2019","unstructured":"Liu HW, Liu ZX (2019) An efficient Barzilai\u2013Borwein conjugate gradient method for unconstrained optimization. J Optim Theory Appl 180(3):879\u2013906","journal-title":"J Optim Theory Appl"},{"key":"1301_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal J, Wright SJ (1999) Numerical optimization. Springer, New York"},{"issue":"4","key":"1301_CR24","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(4):94\u2013112","journal-title":"USSR Comput Math Math Phys"},{"key":"1301_CR25","first-page":"1152","volume":"268","author":"M Rivaie","year":"2015","unstructured":"Rivaie M, Mamat M, Abashar A (2015) A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches. Appl Math Comput 268:1152\u20131163","journal-title":"Appl Math Comput"},{"issue":"4","key":"1301_CR26","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-015-0310-7","volume":"63","author":"DA Tarzanagh","year":"2015","unstructured":"Tarzanagh DA, Peyghami MR (2015) A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems. J Glob Optim 63(4):709\u2013728","journal-title":"J Glob Optim"},{"issue":"8","key":"1301_CR27","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1007\/s11590-015-0977-1","volume":"10","author":"HJ Wei","year":"2016","unstructured":"Wei HJ, Yang WH (2016) A Riemannian subspace limited-memory SR1 trust-region method. Optim Lett 10(8):1705\u20131723","journal-title":"Optim Lett"},{"issue":"2","key":"1301_CR28","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(2):1156\u20131188","journal-title":"Appl Math Comput"},{"key":"1301_CR29","unstructured":"Yuan YX (2014) A review on subspace methods for nonlinear optimization. In: Proceedings of the international congress of mathematics, Seoul, pp 807\u2013827"},{"issue":"3","key":"1301_CR30","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/imanum\/11.3.325","volume":"11","author":"YX Yuan","year":"1991","unstructured":"Yuan YX (1991) A modified BFGS algorithm for unconstrained optimization. IAM J Numer Anal 11(3):325\u2013332","journal-title":"IAM J Numer Anal"},{"issue":"2","key":"1301_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11081-008-9064-0","volume":"10","author":"YX Yuan","year":"2009","unstructured":"Yuan YX (2009) Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim Eng 10(2):207\u2013218","journal-title":"Optim Eng"},{"issue":"1","key":"1301_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/zamm.19950750118","volume":"75","author":"YX Yuan","year":"1995","unstructured":"Yuan YX, Stoer J (1995) A subspace study on conjugate gradient algorithms. Z Angew Math Mech 75(1):69\u201377","journal-title":"Z Angew Math Mech"},{"issue":"2","key":"1301_CR33","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 equations. J Comput Appl Math 137(2):269\u2013278","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1301_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"JZ Zhang","year":"1999","unstructured":"Zhang JZ, Deng NY, Chen LH (1999) New quasi-Newton equation and related methods for unconstrained optimization. J Optim Theory Appl 102(1):147\u2013167","journal-title":"J Optim Theory Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-020-01301-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01301-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T23:53:49Z","timestamp":1629244429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-020-01301-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,18]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1301"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01301-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2020,8,18]]},"assertion":[{"value":"20 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"251"}}