{"entities":{"Q1425915":{"pageid":1436655,"ns":120,"title":"Item:Q1425915","lastrevid":67417656,"modified":"2026-04-12T17:29:44Z","type":"item","id":"Q1425915","labels":{"en":{"language":"en","value":"Dual barrier-projection and barrier-Newton methods for linear programming problems."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2060739"}},"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":"Q1425915$3EA85FB0-0A7D-4AE7-ACA4-DC6E005011AA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8a3faa61e6a2d4d70b1479150de29d73a8251cf7","datavalue":{"value":{"text":"Dual barrier-projection and barrier-Newton methods for linear programming problems.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1425915$EA333306-DBD7-4179-8445-69139B6BF215","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2612672573af25f671ab9a57559cd4cf100e664d","datavalue":{"value":"1161.90435","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1425915$C77924E0-2E0F-4B4E-A2A2-DA3B009620F1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a438af6643ae7f561353c4bef7c698e900a48bd3","datavalue":{"value":{"entity-type":"item","numeric-id":178986,"id":"Q178986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1425915$EC87A611-B6E4-4B0A-BBE5-9818D22FBDB8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d60dec33961b22e29f176c80d1ddc494634e3769","datavalue":{"value":{"time":"+2004-03-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1425915$F53833DD-B687-4B26-ADE0-80B9BF23C8FB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1425915$C9C51948-B79B-41CF-91FB-D49C0897E96D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"509be2a87143b85f63caca2be452b63aa543049a","datavalue":{"value":"2060739","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1425915$EAA35F92-264E-4A0F-95F5-B00342DFBE3F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3070aef977ee52e70ca388a6e1ee955f511eea0a","datavalue":{"value":{"entity-type":"item","numeric-id":1342878,"id":"Q1342878"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1425915$D3725D5F-3A71-4528-8417-66F73E0B094A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"58ec36660813c6464e1abfff0cb33fc547105d2a","datavalue":{"value":{"entity-type":"item","numeric-id":1342879,"id":"Q1342879"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1425915$673549F7-BCF6-4F67-92EE-CD9C807F031B","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":"Q1425915$D58DC2D2-4271-44E0-AB7F-F55CC92551BB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dual barrier-projection and barrier-Newton methods for linear programming problems.","badges":[]}}}}}