{"entities":{"Q2764359":{"pageid":2775098,"ns":120,"title":"Item:Q2764359","lastrevid":79355084,"modified":"2026-05-06T13:43:23Z","type":"item","id":"Q2764359","labels":{"en":{"language":"en","value":"A modified SQP algorithm for LCP constrained MP"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1690362"}},"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":"Q2764359$29173285-CB84-4B3B-ADCB-D278FA5FBB6A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7dc1e2e577fb5fac1c94322a6743e251c570dddd","datavalue":{"value":"0990.90114","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2764359$FD8580FD-765A-4286-9D52-9B213068ED28","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"65689befb76bebfa112d5aae0116994aa2055bfd","datavalue":{"value":{"entity-type":"item","numeric-id":344249,"id":"Q344249"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2764359$419B43AD-8C9C-49E3-B471-BD9512071102","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0004237905b7322cb3b10a20c84f2f03323c8c30","datavalue":{"value":{"time":"+2002-08-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2764359$7049A3B5-3476-4AEE-A26E-0D89B278E6FB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"78bd61792d92729e04574cd38c2ab8f5ce258568","datavalue":{"value":"90C33","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2764359$0AC40B22-4C34-4B31-9F08-D6B5140D5616","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c562ee8daf10183438dc5f4f8a927d99548d37df","datavalue":{"value":"90C55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2764359$7D455E0C-40BE-4B52-95C8-450083269589","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"153b2ee98aad50c304d42ee4c163229ba9a4fa29","datavalue":{"value":"1690362","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2764359$440338C1-C89F-405D-B5FA-EB4EA8FC3490","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"895da7dee65ee0d8111cfb0bf6bb50b6bc5bfe8f","datavalue":{"value":"linear complementarity problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2764359$70E56E4A-89C1-4BFE-B78D-14839B509EDC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f0dcf03387e9fe34aca1527c4829de4dff741ec8","datavalue":{"value":"modified sequential quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2764359$4DF0C6EC-30E1-41C3-BDC5-533E630E8A71","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":"Q2764359$00340DD8-3895-4B4A-89B7-F515577BE59B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"392eb57ed91faa62954e882d9eb6dafbe83473bc","datavalue":{"value":{"text":"A modified SQP algorithm for LCP constrained MP","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2764359$DBC47F2C-E589-49EE-B500-604396D1BAF5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"17c4aba44551aa99235d167f3f76f3322039b80e","datavalue":{"value":{"entity-type":"item","numeric-id":6769633,"id":"Q6769633"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2764359$116DE526-EC68-47AC-BF74-DB81D406B9F1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A modified SQP algorithm for LCP constrained MP","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_modified_SQP_algorithm_for_LCP_constrained_MP"}}}}}