{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:55:08Z","timestamp":1743090908772},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T00:00:00Z","timestamp":1337212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11590-012-0491-7","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T12:16:33Z","timestamp":1337170593000},"page":"1047-1059","source":"Crossref","is-referenced-by-count":8,"title":["An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost"],"prefix":"10.1007","volume":"7","author":[{"given":"Anatoly","family":"Zhigljavsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Pronzato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Bukina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,17]]},"reference":[{"key":"491_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J. Barzilai","year":"1988","unstructured":"Barzilai J., Borwein J.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"491_CR2","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/1968733","volume":"41","author":"P. Erd\u00f6s","year":"1940","unstructured":"Erd\u00f6s P., Turan P.: On interpolation. III. Interpolation theory of polynomials. Ann. Math. 41(3), 510\u2013553 (1940)","journal-title":"Ann. Math."},{"key":"491_CR3","volume-title":"Matrix Computations, 3rd edn","author":"G. Golub","year":"1996","unstructured":"Golub G., Loan C.V.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)"},{"key":"491_CR4","doi-asserted-by":"crossref","unstructured":"Haycroft, R., Pronzato, L., Wynn, H., Zhigljavsky, A.: Studying convergence of gradient algorithms via optimal experimental design theory. In: Optimal Design and Related Areas in Optimization and Statistics, pp. 13\u201337. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-79936-0_2"},{"issue":"4","key":"491_CR5","first-page":"315","volume":"31","author":"M.A. Krasnosel\u2019skii","year":"1952","unstructured":"Krasnosel\u2019skii M.A., G.Krein S.: An iteration process with minimal residues. Mat. Sb. 31(4), 315\u2013334 (1952)","journal-title":"Mat. Sb."},{"key":"491_CR6","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/BF01934919","volume":"24","author":"G. Meurant","year":"1984","unstructured":"Meurant G.: The block preconditioned conjugate gradient method on vector computers. BIT 24, 623\u2013633 (1984)","journal-title":"BIT"},{"issue":"3","key":"491_CR7","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-005-0602-7","volume":"107","author":"L. Pronzato","year":"2006","unstructured":"Pronzato L., Wynn H., Zhigljavsky A.: Asymptotic behaviour of a family of gradient algorithms in $${\\mathbb{R}^d}$$ and Hilbert spaces. Math. Program. A 107(3), 409\u2013438 (2006)","journal-title":"Math. Program. A"},{"key":"491_CR8","doi-asserted-by":"crossref","unstructured":"Pronzato. L., Wynn. H.P., Zhigljavsky. A.: A dynamical-system analysis of the optimum s-gradient algorithm. In: Optimal Design and Related Areas in Optimization and Statistics, pp. 39\u201380. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-79936-0_3"},{"issue":"3","key":"491_CR9","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10589-010-9319-5","volume":"50","author":"L. Pronzato","year":"2011","unstructured":"Pronzato L., Zhigljavsky A.: Gradient algorithms for quadratic optimization with fast convergence rates. Comput. Optim. Appl. 50(3), 597\u2013617 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"491_CR10","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0906059","volume":"6","author":"Y. Saad","year":"1985","unstructured":"Saad Y.: Practical use of polynomial preconditionings for the conjugate gradient method. SIAM J. Sci. Stat. Comp. 6(4), 865\u2013881 (1985)","journal-title":"SIAM J. Sci. Stat. Comp."},{"key":"491_CR11","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1017\/S0305004100042195","volume":"63","author":"B. Slater","year":"1967","unstructured":"Slater B.: Gaps and steps for the sequence n \u03b8 mod 1. Math. Proc. Camb. Phil. Soc. 63, 1115\u20131123 (1967)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"491_CR12","doi-asserted-by":"crossref","unstructured":"van der Vorst, H.A. (2002) Iterative methods for large linear systems. Tech. rep., Math. Inst. Utrecht Univ.","DOI":"10.1017\/CBO9780511615115"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0491-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0491-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0491-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T20:04:51Z","timestamp":1561752291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0491-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,17]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0491-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,17]]}}}