{"entities":{"Q3465290":{"pageid":5244692,"ns":120,"title":"Item:Q3465290","lastrevid":80534939,"modified":"2026-05-06T16:25:11Z","type":"item","id":"Q3465290","labels":{"en":{"language":"en","value":"Feasible iterative algorithms and strong convergence theorems for bi-level fixed point problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6533931"}},"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":"Q3465290$528A1BD5-79B5-444F-B2EF-48BB86874542","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"01e8cbe09bf19fd6b9d249f24e67f515f21248f0","datavalue":{"value":{"text":"Feasible iterative algorithms and strong convergence theorems for bi-level fixed point problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3465290$9B8CE6E0-6040-4247-B7AD-3483E1B106E1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"548b72fcfa58150ed20f93991490f8f1ca2a8f41","datavalue":{"value":{"entity-type":"item","numeric-id":265136,"id":"Q265136"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3465290$A9C6C576-8F86-4747-88B9-22D669FC5AAE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"eccb232292ea5ecb210fa50d0da20ec71313f190","datavalue":{"value":{"entity-type":"item","numeric-id":426325,"id":"Q426325"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3465290$4FA870FD-2A93-4737-AF55-EABDE2DF8D93","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7c01e8b0224bde34058680c852948bd730d22443","datavalue":{"value":{"entity-type":"item","numeric-id":592988,"id":"Q592988"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3465290$A1B2A388-B084-438D-A03D-B3AA9836B92A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6937e10c11873e4101540e0d8cbdc70be054cd81","datavalue":{"value":{"time":"+2016-01-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":"Q3465290$4B8FFA16-520F-4DCA-B34A-458E252582BE","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"086939e6b3ab1289d1239e822c3e47c46ee65934","datavalue":{"value":"http://www.tjnsa.com/includes/files/articles/Vol9_Iss4_1515--1528_Feasible_iterative_algorithms_and_s.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q3465290$C0806AE9-9DE7-4197-B1AC-A2E0D2B511F0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"361d69a4ad84271d7fa61ff79cb8511b17f8dbee","datavalue":{"value":"47J25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$4691520A-279D-4FBF-883F-103B1C792200","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"05e6210e40591bf6d46e34fb771f5fdc4d5a5a2c","datavalue":{"value":"47H09","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$B49D8F82-C93C-4958-A9DE-20C1B8CDD46A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"843de71235f44a800ae389e1734df6bb7650efec","datavalue":{"value":"65K10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$1D75859E-300E-4697-B00B-EDD5F7A95696","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b7e1a8f04382e46f855e4ab5e418c2f6c9cf085f","datavalue":{"value":"6533931","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$BBC26A1E-1FC4-4A03-8833-77F2F53ECD81","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1241df63c33eb713fdca58c19bc205ea99598101","datavalue":{"value":"bi-level split fixed point problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3465290$C6B2EF95-F22A-41B4-9024-C8F195A1AD42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a373acd8e8cc556f71ee95d5fb884fafa36cf708","datavalue":{"value":"bi-level split equilibrium problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3465290$66BC5101-D878-40F1-8FC8-8886D8D5169E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"998fd6728905e5e44e6a713a9d8b59a9e83b7ca8","datavalue":{"value":"bi-level split optimization problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3465290$C9D96F13-977F-43DB-8377-F5589783A9A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d5dfc314f87a2715b3ece4b75ffe80100a52b817","datavalue":{"value":"bi-level split variational inequality problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3465290$87EB74B6-6081-427E-95E9-0A778AA0FA43","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1806feb4ba3edeabc062eb8f39be305be6046d33","datavalue":{"value":"split feasibility problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3465290$247136E5-6071-47C0-807C-D66361192018","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":"Q3465290$1BF3CB58-8864-4555-9F23-DED11C60C7D2","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a223c7a075dc9039e06fbb56320bee17a0906348","datavalue":{"value":"W2783237417","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$530EABC0-3203-4B36-90EC-24A6585B458E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d0aa068357c6a820325b65705fbf0bbff0a930dc","datavalue":{"value":"10.22436/JNSA.009.04.10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3465290$52BDD85F-0714-4B26-886E-337E6777B418","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8a66a0baa054096575bc7d83c76bf9fa7137a319","datavalue":{"value":{"entity-type":"item","numeric-id":4630630,"id":"Q4630630"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3465290$BE83F270-8DEB-4AC5-A9FD-3E78A56E6300","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Feasible iterative algorithms and strong convergence theorems for bi-level fixed point problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Feasible_iterative_algorithms_and_strong_convergence_theorems_for_bi-level_fixed_point_problems"}}}}}