{"entities":{"Q2474684":{"pageid":2485427,"ns":120,"title":"Item:Q2474684","lastrevid":73336203,"modified":"2026-04-14T15:29:02Z","type":"item","id":"Q2474684","labels":{"en":{"language":"en","value":"An algorithm for solving the convex feasibility problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5244315"}},"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":"Q2474684$B684E460-8E03-44E6-A8B4-066FC98DEF6D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6f8eff7fbd2910d150258d05787a086900868c17","datavalue":{"value":{"text":"An algorithm for solving the convex feasibility problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2474684$DEC32981-765D-460B-B091-65F6B6B59909","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c94482828b8de746cc35b77236588d6416a644c6","datavalue":{"value":"1171.90473","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2474684$8C23F4C7-3ABD-4F52-BFA5-5D3817D9C9E6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c148feeba5bb8c7b0859068af398441cb0a9095f","datavalue":{"value":"10.1504/IJOR.2007.012855","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2474684$D8A7691E-D864-473F-B389-800FB3817259","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"13a8b8f7e6bca37e52ed72a0eef992f578ab74f7","datavalue":{"value":{"entity-type":"item","numeric-id":2474683,"id":"Q2474683"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2474684$C86BC381-29D0-4D9F-B323-2A26DAEF20EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"13e0511fefc786de54a422c99155f672286f7b1e","datavalue":{"value":{"entity-type":"item","numeric-id":1753738,"id":"Q1753738"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2474684$A644F7F4-CA45-489F-BE3D-2EA503DFDA50","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2416e8a5c76a3e001f6e57b132d70eaeca49c502","datavalue":{"value":{"entity-type":"item","numeric-id":541285,"id":"Q541285"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2474684$EB2FFBC6-FB10-4E2D-B443-BE034E4F5B76","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cf82d0ee1f43b6e127707e975562f6a0a8754bd6","datavalue":{"value":{"time":"+2008-03-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2474684$728CE021-5338-44BA-A51E-472AC093803D","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c6c42416df322ee05887fce119c51784b7a2c463","datavalue":{"value":"Summary: This paper presents a volumetric cutting plane algorithm for finding a feasible point in a convex set. It is based on the volumetric barrier function where Newton steps are taken and a line search is performed in order to re-center following the addition or deletion of a constraint. The placement of the separating hyperplane in relation to the volumetric center is discussed from a theoretic perspective and then further explored in the practical implementation of the algorithm. Promising values for the parameters that have the greatest influence on the performance of the algorithm are presented.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2474684$5EE8A7A4-2B9E-4770-A0AC-46431C683AEC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"63b70ec5cb69f5c5c9550409918141ca28bfae61","datavalue":{"value":"90C08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2474684$CAC7EF2B-9155-4EEE-80C2-8106FC1E7769","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e430ae85f9757522e8943b29e6cb1efe9a06e700","datavalue":{"value":"5244315","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2474684$288B4835-C7B6-4C2E-BD36-6A9D790304C5","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e557a89ff7025dba8c036e0334f778015f9cea60","datavalue":{"value":"line searches","type":"string"},"datatype":"string"},"type":"statement","id":"Q2474684$475D45E5-C7B2-492A-B6A2-EE3DC7E372B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"065d4d0221641f8883003111812d9ce010d09474","datavalue":{"value":"separating hyperplane","type":"string"},"datatype":"string"},"type":"statement","id":"Q2474684$0850DF84-D3DF-4FD2-AC54-8133F6479D2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9fdfe2c4936c8e7d8ce91372336e8a5977fce31c","datavalue":{"value":"volumetric cutting plane algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2474684$81E3C5D4-C1AD-48A7-AE62-C144AE91E013","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e25407dc8320add1cb67d83d54ebb7f7b433a6c5","datavalue":{"value":"volumetric center","type":"string"},"datatype":"string"},"type":"statement","id":"Q2474684$1D5A328B-3207-4CA9-AE0C-6B9D1864BAD6","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":"Q2474684$B0DB6DED-10DA-49F3-B4CA-2A671EB6D9F4","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8fb92e6b78cc9d45acaefa0ce3ea6fe7a01f2edd","datavalue":{"value":{"entity-type":"item","numeric-id":4229486,"id":"Q4229486"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d0081c3f50c6eadb35a1f2942b1ed7982186bcaf","datavalue":{"value":{"amount":"+0.8375555276870728","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":"Q2474684$14079570-F41C-44C7-94A2-2D2BAEADB750","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"13ef20a9a3ed8b644caf13c41e102869d11ed25d","datavalue":{"value":{"entity-type":"item","numeric-id":4339373,"id":"Q4339373"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"553669d4a30538e2f21eba30c5b01d6bd7e7a5c4","datavalue":{"value":{"amount":"+0.8278205394744873","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":"Q2474684$AEB08995-F97F-4FE1-8BDE-9816DBBC0E4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5a5b5cc5ebbece9b162acfd2931357c0fb81d555","datavalue":{"value":{"entity-type":"item","numeric-id":1918926,"id":"Q1918926"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c749b7b55198caee9600e46f5a79f1b5ecd73071","datavalue":{"value":{"amount":"+0.8116478323936462","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":"Q2474684$8463CF86-9855-42FB-B642-22492FAE5FBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e3f450b682b7247b215c8a68546d9ae2b4e6358b","datavalue":{"value":{"entity-type":"item","numeric-id":4653547,"id":"Q4653547"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1b399a1ec4629b2de6a35b62bfa47014d86dabb3","datavalue":{"value":{"amount":"+0.8084995746612549","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":"Q2474684$F2AA8D40-BE0B-439E-88C4-CC836F1B7C96","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"12ebe91fecfeca42d3197dd85d08aa557b8c5d9a","datavalue":{"value":{"entity-type":"item","numeric-id":2735076,"id":"Q2735076"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6c316e272a235c2850683b76cccb05246d15ceee","datavalue":{"value":{"amount":"+0.7993030548095703","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":"Q2474684$06BF6C62-7B25-4B88-A46E-B77BCDC01615","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for solving the convex feasibility problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_solving_the_convex_feasibility_problem"}}}}}