{"entities":{"Q1380197":{"pageid":1390937,"ns":120,"title":"Item:Q1380197","lastrevid":68764977,"modified":"2026-04-13T01:54:50Z","type":"item","id":"Q1380197","labels":{"en":{"language":"en","value":"General method of convex programming with prescribed accuracy"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1122693"}},"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":"Q1380197$634F5019-8F92-4333-8736-79ED0AD967FB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e0551a606745563302c98a0eb35a3c03edd5c018","datavalue":{"value":{"text":"General method of convex programming with prescribed accuracy","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1380197$F5C1C910-DAD9-4A1F-B096-ADAEBB55E2D4","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a337418586646391416839314a24548a38560ee0","datavalue":{"value":"0887.65064","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1380197$7549FDC7-525D-4951-98D8-0B8429AC4DC8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a07e5be24741a9789aa76d51b6c9f5a9f2b7efcf","datavalue":{"value":{"entity-type":"item","numeric-id":1103517,"id":"Q1103517"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1380197$7A21E0F5-D270-4534-ABF0-EE971E0A0225","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c8cc0b24a511587a6aabb89779d4f54eec772cb1","datavalue":{"value":{"entity-type":"item","numeric-id":1422280,"id":"Q1422280"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1380197$9AB6F511-A855-4ED4-BFE2-96B8816FD05F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"62318960435ff4e0b6f0bda102e1b989b0fc569e","datavalue":{"value":{"entity-type":"item","numeric-id":268929,"id":"Q268929"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1380197$1155610D-BBD5-4B2E-9E4D-BD9847B04559","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4ff419243b28fa9d39bc2b53155a27e240a83493","datavalue":{"value":{"time":"+1998-03-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1380197$45DCB00A-7258-4180-9435-32F7C843A36B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"cbae592080bbe9d37ca3a21c3e2f1d497839ee87","datavalue":{"value":"We suggest a generalization of the finite method for solving with prescribed accuracy by the goal functional the convex programming problem.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$6BA18894-1C06-47D9-B695-2FE3AB55B28B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1380197$E071E9E6-DFB4-4DE3-BC8F-711D8B39128C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1380197$C319917B-C5FB-450E-8F42-9F7019ABA31F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"029224feaa23c10bf0a20e7c543fe64f3de45a0f","datavalue":{"value":"90C48","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1380197$3804305F-AFB3-4DDF-8B38-256F3EEC67AC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"20ef3e449ed29fb020c5cd53bcd09ee7bed5ecc4","datavalue":{"value":"1122693","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1380197$B6F3668C-6398-4AA3-BB28-96C373917766","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"27db29e1545997752d0ba25fa3e41f101d1cfb85","datavalue":{"value":"Hilbert space","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$D8BD7EC6-A6FB-4658-B65A-1385CF277F09","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0c6b199903864f3033b1a391aa346c30f87adf67","datavalue":{"value":"finite method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$8694AF10-3284-4208-8B50-3627C0524220","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f1a671f7a2bc7be818017e5d629b3352bf7c69a1","datavalue":{"value":"prescribed accuracy","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$FDBC6019-1EF5-43DD-9F0C-DA0A40CA9100","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e803023f7ca60596c97b648b5ed489088e4a705","datavalue":{"value":"goal functional","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$953B9565-6054-401D-8D63-66ACFC271101","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6967e67113aaa139c1c0b5c2a96849f0ad345afa","datavalue":{"value":"convex programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1380197$51F489FF-4579-49D8-887D-9447341A0089","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":"Q1380197$1EA8EFC4-97DC-43DC-8CF6-8B8B0E7FB5C5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"General method of convex programming with prescribed accuracy","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/General_method_of_convex_programming_with_prescribed_accuracy"}}}}}