{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:02:36Z","timestamp":1649185356474},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,29]],"date-time":"2013-03-29T00:00:00Z","timestamp":1364515200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10589-013-9558-3","type":"journal-article","created":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T20:02:32Z","timestamp":1364500952000},"page":"317-341","source":"Crossref","is-referenced-by-count":3,"title":["Symmetric Perry conjugate gradient method"],"prefix":"10.1007","volume":"56","author":[{"given":"Dongyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Genqi","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,29]]},"reference":[{"key":"9558_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.: Descent property and global convergence of the Fletcher-Reeves method with inexact line-search. IMA J. Numer. Anal. 5, 121\u2013124 (1985)","journal-title":"IMA J. Numer. Anal."},{"key":"9558_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10589-007-9055-7","volume":"38","author":"N. Andrei","year":"2007","unstructured":"Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38, 401\u2013416 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9558_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.aml.2006.06.015","volume":"20","author":"N. Andrei","year":"2007","unstructured":"Andrei, N.: A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization. Appl. Math. Lett. 20, 645\u2013650 (2007)","journal-title":"Appl. Math. Lett."},{"key":"9558_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y.H. Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugate conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"9558_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y.H. Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.X.: A nonlinear conjugate gradient with a strong global convergence properties. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"9558_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program., Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Program., Ser. A"},{"key":"9558_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R.M. Fletcher","year":"1964","unstructured":"Fletcher, R.M., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"1","key":"9558_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J.C. Gilbert","year":"1992","unstructured":"Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9558_CR9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9558_CR10","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W.W. Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"9558_CR11","first-page":"35","volume":"2","author":"W.W. Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"9558_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"W.W. Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32(1), 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"9558_CR13","unstructured":"Hager, W.W., Zhang, H.: The limited memory conjugate gradient method (2012). www.math.ufl.edu\/~hager\/papers\/CG\/lcg.pdf"},{"key":"9558_CR14","first-page":"22","volume":"1","author":"J.Y. Han","year":"1997","unstructured":"Han, J.Y., Liu, G.H., Yin, H.X.: Convergence of Perry and Shanno\u2019s memoryless quasi-Newton method for nonconvex optimization problems. OR Trans. 1, 22\u201328 (1997)","journal-title":"OR Trans."},{"issue":"6","key":"9558_CR15","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M.R. Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013439 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9558_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"Y. Liu","year":"1991","unstructured":"Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69, 129\u2013137 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"9558_CR17","volume-title":"Computational Intelligence and Software Engineering (CiSE)","author":"D.Y. Liu","year":"2010","unstructured":"Liu, D.Y., Shang, Y.F.: A new Perry conjugate gradient method with the generalized conjugacy condition. In: Computational Intelligence and Software Engineering (CiSE), 2010 International Conference on Issue Date: 10\u201312 Dec. 2010. doi: 10.1109\/CISE.2010.5677114"},{"issue":"2","key":"9558_CR18","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10589-009-9302-1","volume":"49","author":"D.Y. Liu","year":"2011","unstructured":"Liu, D.Y., Xu, G.Q.: Applying Powell\u2019s symmetrical technique to conjugate gradient methods. Comput. Optim. Appl. 49(2), 319\u2013334 (2011). doi: 10.1007\/s10589-009-9302-1","journal-title":"Comput. Optim. Appl."},{"key":"9558_CR19","doi-asserted-by":"crossref","unstructured":"Liu, D.Y., Xu, G.Q.: A Perry descent conjugate gradient method with restricted spectrum, optimization online, nonlinear optimization (unconstrained optimization), March 2011. http:\/\/www.optimization-online.org\/DB_HTML\/2011\/03\/2958.html","DOI":"10.1186\/1029-242X-2011-57"},{"key":"9558_CR20","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF01580654","volume":"10","author":"S.S. Oren","year":"1976","unstructured":"Oren, S.S., Spedicato, E.: Optimal conditioning of self-scaling variable metric algorithms. Math. Program. 10, 70\u201390 (1976)","journal-title":"Math. Program."},{"issue":"6","key":"9558_CR21","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A. Perry","year":"1978","unstructured":"Perry, A.: A modified conjugate gradient algorithm. Oper. Res., Tech. Notes 26(6), 1073\u20131078 (1978)","journal-title":"Oper. Res., Tech. Notes"},{"issue":"16","key":"9558_CR22","first-page":"35","volume":"3","author":"E. Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Fr. Inform. Rech. Oper. 3(16), 35\u201343 (1969)","journal-title":"Rev. Fr. Inform. Rech. Oper."},{"key":"9558_CR23","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B.T. Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"9558_CR24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"M.J.D. Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12, 241\u2013254 (1977)","journal-title":"Math. Program."},{"key":"9558_CR25","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"D.F. Shanno","year":"1978","unstructured":"Shanno, D.F.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 244\u2013256 (1978)","journal-title":"Math. Oper. Res."},{"key":"9558_CR26","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1137\/0715085","volume":"15","author":"D.F. Shanno","year":"1978","unstructured":"Shanno, D.F.: On the convergence of a new conjugate gradient algorithm. SIAM J. Numer. Anal. 15, 1247\u20131257 (1978)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9558-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9558-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9558-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T14:00:59Z","timestamp":1562853659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9558-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,29]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9558"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9558-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,29]]}}}