{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:50Z","timestamp":1740124010438,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10957-022-02134-8","type":"journal-article","created":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T20:20:49Z","timestamp":1668543649000},"page":"126-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Monotonicity Result for Norms in Conjugate Gradient Algorithms"],"prefix":"10.1007","volume":"196","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6959-2951","authenticated-orcid":false,"given":"Anton","family":"Schiela","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"issue":"3\u20134","key":"2134_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1081\/NFA-120006694","volume":"23","author":"O Axelsson","year":"2002","unstructured":"Axelsson, O., Kar\u00e1tson, J.: On the rate of convergence of the conjugate gradient method for linear operators in Hilbert space. Numer. Funct. Anal. Optim. 23(3\u20134), 285\u2013302 (2002)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"191","key":"2134_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0025-5718-1990-1023042-6","volume":"55","author":"JH Bramble","year":"1990","unstructured":"Bramble, J.H., Pasciak, J.E., Xu, J.: Parallel multilevel preconditioners. Math. Comput. 55(191), 1\u201322 (1990)","journal-title":"Math. Comput."},{"key":"2134_CR3","doi-asserted-by":"crossref","unstructured":"Concus, P., Golub, G.H. and O\u2019Leary, D.P.: A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations. In: Sparse Matrix Computations (Proc. Sympos., Argonne Nat. Lab., Lemont, Ill., 1975), pp. 309\u2013332 (1976)","DOI":"10.1016\/B978-0-12-141050-6.50023-4"},{"key":"2134_CR4","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM (2000)","DOI":"10.1137\/1.9780898719857"},{"issue":"4","key":"2134_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/nla.305","volume":"10","author":"Y-H Dai","year":"2003","unstructured":"Dai, Y.-H., Mart\u00ednez, J.M., Yuan, J.-Y.: An increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches. Numer. Linear Algebra Appl. 10(4), 323\u2013334 (2003)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2134_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1137\/0704002","volume":"4","author":"JW Daniel","year":"1967","unstructured":"Daniel, J.W.: The conjugate gradient method for linear and nonlinear operator equations. SIAM J. Numer. Anal. 4, 10\u201326 (1967)","journal-title":"SIAM J. Numer. Anal."},{"key":"2134_CR7","unstructured":"Greenbaum, A.: Iterative Methods for Solving Linear Systems, Volume\u00a017 of Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1997)"},{"key":"2134_CR8","first-page":"13","volume":"41","author":"A G\u00fcnnel","year":"2014","unstructured":"G\u00fcnnel, A., Herzog, R., Sachs, E.: A note on preconditioners and scalar products in Krylov subspace methods for self-adjoint problems in Hilbert space. Electron. Trans. Numer. Anal. 41, 13\u201320 (2014)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"2134_CR9","unstructured":"Hanke, M.: Conjugate gradient type methods for ill-posed problems. In: Pitman Research Notes in Mathematics Series, vol. 327. Longman Scientific & Technical, Harlow (1995)"},{"issue":"409\u2013436","key":"2134_CR10","first-page":"1952","volume":"49","author":"MR Hestenes","year":"1953","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49(409\u2013436), 1952 (1953)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"2134_CR11","doi-asserted-by":"crossref","unstructured":"Liesen, J., Strako\u0161, Z.: Krylov Subspace Methods: Principles and Analysis. In the series: Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford (2013)","DOI":"10.1093\/acprof:oso\/9780199655410.003.0002"},{"key":"2134_CR12","doi-asserted-by":"crossref","unstructured":"M\u00e1lek, J., Strako\u0161, Z.: Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs, Volume\u00a01 of SIAM Spotlights. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2015)","DOI":"10.1137\/1.9781611973846"},{"key":"2134_CR13","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer (1999)","DOI":"10.1007\/b98874"},{"issue":"3","key":"2134_CR14","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s11075-021-01228-0","volume":"90","author":"H Oviedo","year":"2022","unstructured":"Oviedo, H., Andreani, R., Raydan, M.: A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization. Numer. Algorithms 90(3), 1225\u20131252 (2022)","journal-title":"Numer. Algorithms"},{"key":"2134_CR15","unstructured":"Reid, J.K.: On the method of conjugate gradients for the solution of large sparse systems of linear equations. In: Large Sparse Sets of Linear Equations (Proc. Conf., St. Catherine\u2019s Coll., Oxford, 1970), pp. 231\u2013254 (1971)"},{"key":"2134_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)","edition":"2"},{"issue":"3","key":"2134_CR17","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3), 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"156","key":"2134_CR18","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/0024-3795(91)90393-B","volume":"154","author":"Z Strako\u0161","year":"1991","unstructured":"Strako\u0161, Z.: On the real convergence rate of the conjugate gradient method. Linear Algebra Appl. 154(156), 535\u2013549 (1991)","journal-title":"Linear Algebra Appl."},{"key":"2134_CR19","doi-asserted-by":"crossref","unstructured":"van der Vorst, H.A.: Iterative Krylov Methods for Large Linear Systems. Cambridge Monographs on Applied and Computational Mathematics, vol. 13. Cambridge University Press, Cambridge (2003)","DOI":"10.1017\/CBO9780511615115"},{"key":"2134_CR20","volume-title":"Nonlinear Functional Analysis and its Applications, vol. II\/A","author":"E Zeidler","year":"1990","unstructured":"Zeidler, E.: Nonlinear Functional Analysis and its Applications, vol. II\/A. Springer, New York (1990)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02134-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02134-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02134-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T16:37:35Z","timestamp":1673282255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02134-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2134"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02134-8","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"16 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}