{"entities":{"Q596679":{"pageid":598455,"ns":120,"title":"Item:Q596679","lastrevid":63059364,"modified":"2026-04-11T10:14:10Z","type":"item","id":"Q596679","labels":{"en":{"language":"en","value":"An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2085901"}},"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":"Q596679$DAA46A0E-0317-4338-B574-C3A62CB82626","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4bc4d431db5b0f19664e1d3c39181029c5391e66","datavalue":{"value":{"text":"An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q596679$28827D0F-3C83-409A-90E6-14A30B3E26E2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"224e749fcd9a50fb0ecff07f31bdf08844923455","datavalue":{"value":"1056.65027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$0E813527-4C1D-4A6F-8D3F-246B399F57AE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b36e24c31804ca26a81296a402482aad187838da","datavalue":{"value":{"entity-type":"item","numeric-id":492055,"id":"Q492055"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$CFABADA9-2A17-4CFC-8920-611F8753459D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c841da2acc6479a5f181c7ba90a600d225f545a7","datavalue":{"value":{"entity-type":"item","numeric-id":596676,"id":"Q596676"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$87B224E2-F9AE-4B86-A998-B3FBF5404B8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"33ddfb307c9566c3a7985cd97839ead23d33b498","datavalue":{"value":{"entity-type":"item","numeric-id":596678,"id":"Q596678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$853AABB0-B4CC-4C04-99CB-9DCD95CD837A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"28676ad150b07f68598586206394309b419d637d","datavalue":{"value":{"entity-type":"item","numeric-id":817151,"id":"Q817151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$2FFCC005-E352-4E44-823D-4DD67CA06002","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"95f4a47752e6dde2f4d6f910dcba94ba8b5377c0","datavalue":{"value":{"entity-type":"item","numeric-id":57895,"id":"Q57895"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$C46DB285-B60C-4B41-BA94-5A73CDA2EB19","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7e0adf53a19cddd0f150137b2408eb7868ef6930","datavalue":{"value":{"time":"+2004-08-10T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q596679$DA0AE5B4-93E6-431F-A704-3C3CB430B475","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"27c70afac4cc5cf34d8ebba82441185b21be7dba","datavalue":{"value":"An accelerated iterative projection method is presented for solving systems of linear inequalities. This method is an extension of the projection methods for solving systems of linear equations given by \\textit{H. Scolnik, N. Echebest, M. T. Guardarucci}, and \\textit{M. C. Vacchino} [Stud. Comput. Math. 8, 457--471 (2001; Zbl 1003.65027); Ann. Oper. Res. 117, 95--115 (2002; Zbl 1023.65026)]. The general scheme is similar to the incomplete projection algorithm, and therefore it is very convenient for parallel processing. The idea is that at the current iterate the set of violated constraints is splitted into subsets or blocks, in such a way that the required incomplete projection is obtained by combining exact projection onto simple convex sets. The new iterate is defined by the projection of the current iterate onto a separating hyperplane. The advantages of this approach are illustrated both theoretically and numerically.","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$96917BAF-5BF3-40E3-86CC-5B7B8BA721CF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"9e4257514d9fd4eac10996fc6305328b84fd9c9b","datavalue":{"value":"65F10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$9205313C-7280-45BA-8316-26E715E5BAE7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"eb5cb61d96d4bffb5c1f89265d1dfa983b8ea136","datavalue":{"value":"15A39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$B13EFA7E-F80B-49D0-A432-34A7186C142B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$91E09891-2011-4C7E-95D5-BB0F9623C746","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$29DD6D31-38EA-43E6-92D5-74826328B0CB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2e426883e198d2c5d4a1cea8cde8a49c17e86b90","datavalue":{"value":"2085901","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$88D1E779-73E6-4228-8739-4D7494F4B147","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4adf329c768abe741c3f203ec398fb03abd9b990","datavalue":{"value":"aggregated projection methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$ADA6C1D4-0371-4B51-B31F-732B84ABBF19","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4aa93aa70da8ecb39b947e4fc788343dc63caacb","datavalue":{"value":"convergence acceleration","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$B4395B85-F052-4BBC-91EB-07508747A343","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"431ad0527b194c43bf7b26fc7f3a3705c49e72a4","datavalue":{"value":"parallel computation","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$F05F2F5C-178F-4F4D-882F-4C6509F713CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1d74cb5419439f42eb1ba8891c8722bd3702922d","datavalue":{"value":"numerical examples","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$5F9CDCD5-518F-443E-95D0-AA7C7E05E7B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4dca7b5d4b7f0fa6a88635dc54f288e09c033798","datavalue":{"value":"systems of linear inequalities","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$FACB977F-AEE7-43FB-AB91-87E712CEDBA6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5ce2424f41f3aa0efd7bda6682bf00fe2181e166","datavalue":{"value":"incomplete projection algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q596679$86748C06-EB74-4186-B8CE-0F3FBB0F7188","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"8aa8ad3857ac64e165735389c658df71b02acef9","datavalue":{"value":{"entity-type":"item","numeric-id":935374,"id":"Q935374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$89755BB3-3144-4B9C-B422-A625DFAF9D81","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"79f53c4df76e4dd0ba1affa50fbdd32be93d8182","datavalue":{"value":{"entity-type":"item","numeric-id":19709,"id":"Q19709"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q596679$DD5F5F02-A24F-488D-B008-2089EAEE1217","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":"Q596679$99FAD54E-87C9-4242-897D-2EE831834B3B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d137f9be78d4e03b42f2c0b8816da76819267849","datavalue":{"value":"https://doi.org/10.1023/b:numa.0000021777.31773.c3","type":"string"},"datatype":"url"},"type":"statement","id":"Q596679$AF1501D7-CAA1-45BF-9A0C-026EEF3E12F2","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"789fdce87d46111e9d892635280449bf8b64ac4a","datavalue":{"value":"W2032138022","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$3789550D-B8F2-47A4-AC16-7F4FFB0B88C9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d24aa20e77b1b74dc45203293fad2d9fa4cf75f1","datavalue":{"value":"10.1023/B:NUMA.0000021777.31773.C3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q596679$45B3DED3-4227-45D4-86F7-E4ECBCC3BD6C","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"78a256d7d1e073e965d9a8a03790681954c53f15","datavalue":{"value":{"entity-type":"item","numeric-id":817152,"id":"Q817152"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2a82070d81306213d2b5b8cf75826d2000c054c7","datavalue":{"value":{"amount":"+0.8848732113838196","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":"Q596679$A1EE6291-EE42-471D-A32E-656300535BFD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e9b2f852d65f3fffd91a9dd2c2cab534af53cdc7","datavalue":{"value":{"entity-type":"item","numeric-id":1275443,"id":"Q1275443"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6e472f82a5b6c81f0535635a26fb6a06b556c358","datavalue":{"value":{"amount":"+0.8354142904281616","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":"Q596679$CDCBD498-4794-4FE2-BB7F-1208D2CECC7E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"06b92b3d5333e8c6adfc71bb71572e2431ca9620","datavalue":{"value":{"entity-type":"item","numeric-id":2768032,"id":"Q2768032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3a7ba3cbbb065da3d9082067daf7791bc0cb47e6","datavalue":{"value":{"amount":"+0.8093869686126709","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":"Q596679$2BED68FE-3400-4353-A26D-8FA700AAB8EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7634d77d637337cee614877ac8dbd1e0ae6932b9","datavalue":{"value":{"entity-type":"item","numeric-id":801637,"id":"Q801637"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3a7ba3cbbb065da3d9082067daf7791bc0cb47e6","datavalue":{"value":{"amount":"+0.8093869686126709","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":"Q596679$08C83AB0-372A-4E87-BD32-E4F32941D264","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9c4ef5160b186fa7b25c1b77940972fc76429790","datavalue":{"value":{"entity-type":"item","numeric-id":2467156,"id":"Q2467156"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c857cae096956445c37cd0108c6af524c019b82d","datavalue":{"value":{"amount":"+0.7996314764022827","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":"Q596679$E23A283D-026F-44F3-AD44-260753D63BB4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_acceleration_scheme_for_solving_convex_feasibility_problems_using_incomplete_projection_algorithms"}}}}}