{"entities":{"Q2710356":{"pageid":2721095,"ns":120,"title":"Item:Q2710356","lastrevid":44667165,"modified":"2025-11-24T21:54:55Z","type":"item","id":"Q2710356","labels":{"en":{"language":"en","value":"Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1590055"}},"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":"Q2710356$784DAAA6-F6F4-48F0-B340-84BED1CE6362","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0ad09dc32b2c6238217f25c3c809113d89d09b89","datavalue":{"value":"1050.90553","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2710356$E6FC1C76-160E-4DBB-9F83-5F7E2D616733","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"16b0dc5807e43e4f031a01ed1077d5f242406c2a","datavalue":{"value":{"time":"+2001-04-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2710356$DEE56564-7992-4A1D-9447-A875BFF78E55","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2710356$97CF7573-1DBC-48C7-87F2-DAD74F4334F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3cc0a69df9833551a36455c96769c276a21473cc","datavalue":{"value":"49J52","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2710356$23473B49-E9B4-44AA-88CC-566BEED9419F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"893f304fc51d4f0a954c079a2181f8a204bc1758","datavalue":{"value":"1590055","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2710356$BC72127D-580C-4AB4-9149-02776EE56E6B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"536b58b875fb6866421b7c723bca30ab48924b2a","datavalue":{"value":{"entity-type":"item","numeric-id":458125,"id":"Q458125"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2710356$0FD51AF2-E071-4124-B8CE-111689002789","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":"Q2710356$B565F2D4-8EE7-4C7F-8FC3-5C8160C6BE58","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"429fee12073d2e111a2dfa213a9f88355990533e","datavalue":{"value":{"text":"Lagrangian decomposition and nonsmooth optimization: bundle algorithm, prox iteration, augmented Lagrangian","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2710356$8264EBA6-23E0-498F-954E-F24FDE917E7F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2710356","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2710356"}}}}}