{"entities":{"Q2200336":{"pageid":2211079,"ns":120,"title":"Item:Q2200336","lastrevid":78309293,"modified":"2026-05-06T11:17:16Z","type":"item","id":"Q2200336","labels":{"en":{"language":"en","value":"A limited memory gradient projection method for box-constrained quadratic optimization problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7249925"}},"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":"Q2200336$5FD8BABD-107A-4987-AC21-7B2220349556","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"06cc21390e1313f2c6e89d877af754e2fc74ed38","datavalue":{"value":{"text":"A limited memory gradient projection method for box-constrained quadratic optimization problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2200336$4C926765-8ECB-4220-94AB-7FE144D4543D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0e210dbeed765aeaa6aacd059c6b19cc322838a7","datavalue":{"value":"10.1007/978-3-030-39081-5_15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2200336$C18215C4-F4B4-4F98-A8B6-3A0D772AADFE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b7fdf4747103bd9d6cdfa81df753b0028d733a4f","datavalue":{"value":{"entity-type":"item","numeric-id":1740169,"id":"Q1740169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2200336$6E769B72-8C86-430E-AF0F-2B49D99FBEFD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1a176bbb795ad0003c347747e797962274919f07","datavalue":{"value":{"entity-type":"item","numeric-id":298851,"id":"Q298851"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2200336$D23D95CF-7193-4301-8404-A380C655555D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bda18c7cd9bb02bf8846b58ebaf6391ab4a6ae42","datavalue":{"value":{"entity-type":"item","numeric-id":480930,"id":"Q480930"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2200336$2F3A34A8-E13D-4B2B-A4B8-B4B149E0631A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"470781ad59f691dffb1eaea29afa4991e0cfefab","datavalue":{"value":{"entity-type":"item","numeric-id":1008799,"id":"Q1008799"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2200336$A5BB9DC1-B98C-42DC-B199-C6405D0DCF99","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5c9e526165deda8da0ad33894771c6e4c7c71bf3","datavalue":{"value":{"time":"+2020-09-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":"Q2200336$B518FC76-9C48-42F3-A303-F0653482AF51","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"51d647e27b28911428d1e10e901ad03eba3d6a07","datavalue":{"value":"65-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2200336$84E86207-64A9-4105-AA61-1ABF4B45CE45","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6fe83a1427e04b03c6666da9d17592c7e746f302","datavalue":{"value":"7249925","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2200336$542F3D65-187B-4DEE-9F68-8715AA9D4007","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e69e213b51557cc1d7697165bed961e402ad508","datavalue":{"value":"quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2200336$727476A7-149E-4970-838E-C36D1D654C1B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37842dab40a35cac1c6a21ae50ba577799bfd0b6","datavalue":{"value":"gradient projection methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q2200336$4FCCB79D-B643-4C65-AF68-3A7B6A0C5135","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a3aad52bfff3f1cdfd541be9103c733b63aa2689","datavalue":{"value":"steplength selection rule","type":"string"},"datatype":"string"},"type":"statement","id":"Q2200336$C9300559-30E5-47CC-B954-84583C4CBBFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"93868faaaa67c8c329f81eb0679196ad17ec46c0","datavalue":{"value":"Ritz-like values","type":"string"},"datatype":"string"},"type":"statement","id":"Q2200336$6AE6C794-E1D3-4EFD-85AA-33AE7C6911F9","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":"Q2200336$8BA92C80-E9B2-4F71-8FB0-8334704E752B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"bc175b3b053866c375d6c14fcddff4e15804b6a2","datavalue":{"value":"https://doi.org/10.1007/978-3-030-39081-5_15","type":"string"},"datatype":"url"},"type":"statement","id":"Q2200336$0C7B36DF-232E-48B6-80A4-5063FCFFA10A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6ef716ccbafc0f0d67094bd4872c5b3bb7070d59","datavalue":{"value":"W3006673082","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2200336$552394AF-1C2B-448A-8FBC-ACB09A849026","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A limited memory gradient projection method for box-constrained quadratic optimization problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_limited_memory_gradient_projection_method_for_box-constrained_quadratic_optimization_problems"}}}}}