{"entities":{"Q6897722":{"pageid":20883829,"ns":120,"title":"Item:Q6897722","lastrevid":75490840,"modified":"2026-04-19T06:21:04Z","type":"item","id":"Q6897722","labels":{"en":{"language":"en","value":"First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8123864"}},"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":"Q6897722$9C4A385B-D16D-4FBE-81A5-76A7672B247E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"fa6123065932b69ed442978039b6cc383e4cf0a0","datavalue":{"value":{"text":"First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6897722$7E540E3A-77B3-4540-A2B8-18CAB99A9DC1","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"34d5bff7fb702da2ad30680d2b8237336e4d814f","datavalue":{"value":"10.1287/IJOC.2022.0200","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897722$50715B08-8EFB-4C8E-A76C-74C32DE0D134","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c1b1b423fa08c5e45e5cd67ebcde231904d4b9de","datavalue":{"value":{"entity-type":"item","numeric-id":1634283,"id":"Q1634283"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897722$8751A5EC-5E94-49F6-A5CC-3D6D8D269C8D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"905aa40939dc40c0d1f6f814242cdb24b86e50fb","datavalue":{"value":{"entity-type":"item","numeric-id":263221,"id":"Q263221"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897722$FF6E3432-B2C8-4206-AB29-83BB2CFCC5FA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f030fff290cba9104f71fb1447bb02747b898e5f","datavalue":{"value":{"entity-type":"item","numeric-id":74741,"id":"Q74741"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6897722$17138525-A29D-4953-AF7F-EF00E8EE7AA3","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"804cb8321879b3a50f4d87280bc7c6e87039f39c","datavalue":{"value":{"time":"+2025-11-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":"Q6897722$A30B989A-D1E0-44A6-908C-EB1BCCBB0E81","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30e0158d39e8dcc6ee00ca7b3ae626e5899d5903","datavalue":{"value":"90Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897722$57835E5F-9263-43DB-8FA1-33E89DD3F51D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e6f1398745efa906936bde1b130b218817a6d520","datavalue":{"value":"8123864","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6897722$F221854B-433E-471B-B4A2-468E5588764F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6915992d79cfb515074cc438de9b3e413b98cfe1","datavalue":{"value":"convergence analysis","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897722$B7B97FF9-2723-4D71-A47A-B93BB9D61F8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"97c26f975c4ed240b8c00b7c02e61b710ac2852a","datavalue":{"value":"first-order methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897722$C597E1EB-4071-466B-8352-2CB52B25F7B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"87e0e22f581cd71cbecac448cd8596eb0b90e0d5","datavalue":{"value":"robust optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897722$12D094E7-DDED-44E0-A41E-BD8599D8EB83","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d94159c16332cc6c99458da8e4b6b903cc2af999","datavalue":{"value":"saddle point","type":"string"},"datatype":"string"},"type":"statement","id":"Q6897722$504A1059-592F-480D-8C8A-D68C26B0BF87","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":"Q6897722$864E5C15-C97D-4A6D-9CEB-91FBDF91BEED","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/First-order_algorithms_for_robust_optimization_problems_via_convex-concave_saddle-point_Lagrangian_reformulation"}}}}}