{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:06:23Z","timestamp":1773147983452,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,3,1]],"date-time":"1987-03-01T00:00:00Z","timestamp":541555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9635,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1987,3]]},"DOI":"10.1016\/0885-064x(87)90003-3","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"26-40","source":"Crossref","is-referenced-by-count":11,"title":["On the optimality of Krylov information"],"prefix":"10.1016","volume":"3","author":[{"given":"Arthur W","family":"Chou","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(87)90003-3_BIB1","article-title":"Implementation of the GMR Algorithm for Large Symmetric Eigenproblems","author":"Kuczy\u0144ski","year":"1985"},{"key":"10.1016\/0885-064X(87)90003-3_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0885-064X(86)90016-6","article-title":"A generalized minimal residual algorithm for finding an eigenpair of a large matrix","volume":"2","author":"Kuczy\u0144ski","year":"1986","journal-title":"J. Complexity"},{"key":"10.1016\/0885-064X(87)90003-3_BIB3","series-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"key":"10.1016\/0885-064X(87)90003-3_BIB4","article-title":"On the Optimal Solution of Large Linear Systems","author":"Traub","year":"1980","journal-title":"Department of Computer Science Report"},{"issue":"No. 3","key":"10.1016\/0885-064X(87)90003-3_BIB5","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1145\/828.830","article-title":"On the optimal solution of large linear systems","volume":"31","author":"Traub","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0885-064X(87)90003-3_BIB6","first-page":"550","article-title":"Computational complexity of strictly convex programming","volume":"13","author":"Yudin","year":"1977","journal-title":"\u011akonom. i Mat. Metody"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900033?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X87900033?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:23Z","timestamp":1549099403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X87900033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,3]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,3]]}},"alternative-id":["0885064X87900033"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(87)90003-3","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,3]]}}}