{"entities":{"Q556558":{"pageid":558325,"ns":120,"title":"Item:Q556558","lastrevid":62753244,"modified":"2026-04-11T08:13:39Z","type":"item","id":"Q556558","labels":{"en":{"language":"en","value":"On the rate of convergence of a pure greedy algorithm."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2177661"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q556558$BAB6B2B3-3FEE-44E5-A3A1-B1E7CEE6D930","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6baa588f170a7750d3135ae80fc0829fa07d8500","datavalue":{"value":{"text":"On the rate of convergence of a pure greedy algorithm.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q556558$E3ED625E-7980-46FD-9777-D7DC11F62326","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"257d4a9723c246842be9ebcd2bc2c07b1c861d54","datavalue":{"value":"1070.41011","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$76F721F3-8024-4354-9BDF-09FD958CCF60","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"640f12f4c8ca4797a8ce632f7bcb08d08cd40858","datavalue":{"value":{"entity-type":"item","numeric-id":206039,"id":"Q206039"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q556558$86A20214-D0BA-42D2-BB66-457B93D531BF","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"00de3e6b6cfff0576fe0e1d6bc63c05579d2cb43","datavalue":{"value":{"entity-type":"item","numeric-id":173953,"id":"Q173953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q556558$4F00D18D-1ED3-455C-A662-CF5FCC1F488F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"97b8b8c749b23bf1992698b7d9d529fc5bedf609","datavalue":{"value":{"time":"+2005-06-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q556558$B90FDF8A-9F2A-442E-A715-B2627D52BFED","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"4b479becd6d8777b58dc8800f372d08dbe0e910f","datavalue":{"value":"Let \\(H\\) be a real Hilbert space, and let \\(D\\) be a normalized subset of \\(H\\) whose linear hull is everywhere dense. It is assumed that for each \\(f\\in H\\) there exists a \\(g(f)\\in {\\mathcal D}\\) maximizing \\(|\\langle f,g\\rangle|\\). Given an initial vector \\(f_0\\in H\\), the pure greedy algorithm with respect to \\(\\mathcal D\\) generates two sequences \\(\\{g_n\\}^\\infty_{n=1}\\) and \\(\\{f_n\\}^\\infty_{n=1}\\) by means of the formulas \\(g_n:= g(f_{n-1})\\) and \\(f_n:=f_{n-1}-\\langle f_{n-1},g_n\\rangle g_n\\).   \\textit{L. K. Jones} [Ann. Statist. 15, 880--882 (1987)] proved that the sequence \\(\\{G_m(f_0,{\\mathcal D})\\}^\\infty_{m=1}\\) converges to \\(f_0\\), where  \\[ G_m(f_0,{\\mathcal D}):=\\sum^m_{n=1}\\langle f_{n-1},g_n\\rangle g_n. \\]  In order to estimate the rate of convergence the author additionally assumes that there are constants \\(\\alpha>0\\), \\(\\beta\\geq 0\\), \\(M_\\alpha>1\\), \\(M_\\beta>1\\) such that for each positive integer \\(m\\) there exist \\(\\widetilde g_1,\\dots,\\widetilde g_m\\in{\\mathcal D}\\) and \\(c_1,\\dots,c_m\\in\\mathbb R\\) satisfying  \\[ \\| f_0-\\sum^m_{n=1} c_n\\widetilde g_n\\|\\leq \\frac {M_\\alpha}{m^\\alpha}\\text{ and }\\sum^m_{n=1}|c_n|\\leq M_\\beta m^\\beta. \\]  Under this assumption the following estimates are proved:  (1) if \\(\\alpha<1/6\\) and \\(\\alpha+\\beta<1/2\\), then there exists for each \\(\\varepsilon>0\\) a \\(C>0\\) such that  \\[ \\| f_0-G_m(f_0,{\\mathcal D})\\| \\leq C_m^{-\\alpha/(1+2\\alpha)+\\varepsilon} \\]  for all positive integers \\(m\\);  (2) if \\(\\alpha<1/6\\), \\(0<\\beta<1/2\\) and \\(\\alpha/(1+2\\alpha)+\\beta\\geq 1/2\\), then there exists for each \\(\\varepsilon >0\\) a \\(C>0\\) such that  \\[ \\| f_0-G_m(f_0,{\\mathcal D}\\|\\leq C_m-(1/2-\\beta)+\\varepsilon \\]  for all positive integers \\(m\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q556558$0660E19D-674D-45F4-9DA0-0D3EE57BF489","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"f001df82be0de768c14563cbf8648aff7537e926","datavalue":{"value":{"entity-type":"item","numeric-id":593288,"id":"Q593288"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q556558$C75EFB83-1859-423C-8CF3-8C8020560D9C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"dbe7739c02784b5dbd4723e3101dc4f5f70dec58","datavalue":{"value":"41A25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$367343B6-23F8-499B-ADBB-78EB5A9E3B6A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b33c0c41cd7149a10ac86adf523cc72a1f17b274","datavalue":{"value":"41A58","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$11A41C94-0399-41E3-A898-55019B2E6D80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"89346f20a6c5c6b864a211d37f17719b2851c4ad","datavalue":{"value":"41A65","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$7DB82F7E-D08F-46AD-9C01-2721C651401E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d89bd03017a280b2d85f82e66e8f46299f76898b","datavalue":{"value":"2177661","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$72E7EFCB-8F3F-49E4-BEE8-C653F491CF20","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2acb5266ec2f0464a9776894aab3eebafa161226","datavalue":{"value":"pure greedy algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q556558$28DB3BC1-DED0-4771-9275-79303D6F6BCF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c2b974a46a477d665083377a4d301066bda68666","datavalue":{"value":"Hilbert space-rate of convergence of pure greedy algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q556558$A4AFFFF5-D6D6-4C7C-9620-D2C8C2866F2E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q556558$40D8F03B-9A28-405E-8EF1-EE7CEE008DA2","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3a54aa10600016b27956e8d68faad14287407af4","datavalue":{"value":"https://doi.org/10.1023/b:matn.0000043480.05267.e7","type":"string"},"datatype":"url"},"type":"statement","id":"Q556558$DAC412E7-10B1-4B2C-953A-15F6D1758FF8","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"b9aeb7be11b4a5eeb5349d6fe5d52bbc2bacc27c","datavalue":{"value":"W2037868961","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$FDB755C8-426A-4244-A5E0-E128C8CDE0A7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f2ff20033b461b74b5f738d4e0072d26193a3e59","datavalue":{"value":"10.1023/B:MATN.0000043480.05267.E7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q556558$91A5CDF1-BC94-4E55-92EF-88761A635FF1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7fe7986a15663159df80d463f61820694c7e7387","datavalue":{"value":{"entity-type":"item","numeric-id":3405544,"id":"Q3405544"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f317e90eb59f0ebd7895671bb0a5178b842e4af7","datavalue":{"value":{"amount":"+0.8824008703231812","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q556558$B980EC1F-81AE-498B-BC72-B261ED3C4216","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0c864ba47f03d827f71df8b7134bdc55e0756020","datavalue":{"value":{"entity-type":"item","numeric-id":326773,"id":"Q326773"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"480ac64b5edb188aaef56b7ea6b423f94d6adb24","datavalue":{"value":{"amount":"+0.8792518377304077","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q556558$760BDA20-890A-4872-8541-6EF7BD3E8E3A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"59940de99a6cdf684b295957a633e773950567b0","datavalue":{"value":{"entity-type":"item","numeric-id":556573,"id":"Q556573"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d0006e43f23bd3038c57731634eae1bf39161a36","datavalue":{"value":{"amount":"+0.877442479133606","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q556558$CCA6341B-D73F-4A17-AC8A-DDD5508B2A46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"af576ecdd326d90d55c2267d9cd974cd2aa56aed","datavalue":{"value":{"entity-type":"item","numeric-id":1929788,"id":"Q1929788"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"03592ce7abc96a3886a3771d50a62452a287f85a","datavalue":{"value":{"amount":"+0.8769100308418274","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q556558$3762672F-685D-4303-A31D-166F46D30E02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1bd9a4623bc87b4fdb64739abb7952bc86b5f930","datavalue":{"value":{"entity-type":"item","numeric-id":3534169,"id":"Q3534169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8a338c37a6b67ab381a25d4a7b4d8f1070245594","datavalue":{"value":{"amount":"+0.8647384643554688","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q556558$C2581B9F-E781-433F-B10D-D258B4B645E6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the rate of convergence of a pure greedy algorithm.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_rate_of_convergence_of_a_pure_greedy_algorithm."}}}}}