{"entities":{"Q2768025":{"pageid":2778764,"ns":120,"title":"Item:Q2768025","lastrevid":83221532,"modified":"2026-05-07T06:41:59Z","type":"item","id":"Q2768025","labels":{"en":{"language":"en","value":"Parallel subgradient methods for convex optimization."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1698905"}},"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":"Q2768025$DC96D3F8-862A-4CE8-9E97-42E9802A32BC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"35d5244078d2e461aed8ead37503cdea70644ed8","datavalue":{"value":"1039.90052","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768025$7DA9B737-91AB-450E-ACFE-42AFDC4D37C3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c4a9375c61b7877db49ec103b05a39f5a0c7c467","datavalue":{"value":{"entity-type":"item","numeric-id":173838,"id":"Q173838"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768025$8F23CB9F-01F0-435C-941C-DF508B72B489","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"08b551497c5a7cc73f573f0ce269fc0d0ceb562e","datavalue":{"value":{"entity-type":"item","numeric-id":684165,"id":"Q684165"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768025$526D1980-32A7-4A26-B0D6-193EF5647240","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"16d473643aa39024730582f063c01cfbcd820666","datavalue":{"value":{"time":"+2002-04-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2768025$CE23F8EA-A1E4-41B1-99BC-3B529FACD056","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768025$16D84D5F-3FFA-4E51-9A1B-AEBACA95FEE7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3cc0a69df9833551a36455c96769c276a21473cc","datavalue":{"value":"49J52","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768025$E92B4199-2132-4DBC-993F-F1A5C2467A78","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1c889fd3d3f1d91d3d5c24b2b44e8a803601b982","datavalue":{"value":"1698905","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768025$6AFA5475-BEEF-40CF-8E6D-2808A5355287","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4fa9082850ef5aaf62ad9291428eef26530da341","datavalue":{"value":"convex optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768025$BB9CBFE6-BDB8-4FCC-9E9E-1512A48B28C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4194ddc89ecfe5fc55518b6f584d663a167ba1e2","datavalue":{"value":"subgradient method","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768025$26D7931E-2EC2-46DB-9CC8-39897FFC0431","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":"Q2768025$E4285200-E04D-4F26-B4D3-B25D9E9F7BF0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8c44e17bcf4513d1d7e46ee0b7016c4fe4130832","datavalue":{"value":{"text":"Parallel subgradient methods for convex optimization.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2768025$6918B160-4ABC-4EA2-9045-7B98035E8358","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1b1aee5351a0f96935c1c9b923800c67b3eec789","datavalue":{"value":"A subgradient method for minimizing a sum of convex functions on a convex set is given. To generate a search direction, each iteration employs a subgradients of a subset of a subset of the objectives evaluated at the current iterate, as well as past subgradients of the remaining objectives. A stepsize via ballstep level controls for estimating the optimal value. It is established the global convergence of the method. When applied to Lagrangian relaxation of separable problems, the method allows for almost asynchronous parallel solution of Lagrangian subproblems, updating the iterates as soon as new subradient information becomes available.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00058].","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768025$A88CF6A9-8443-413E-8624-E1B01FB976BC","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"7d7f3e3add9d024f2b0d08efd30b0cd30b5413c9","datavalue":{"value":{"entity-type":"item","numeric-id":587981,"id":"Q587981"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768025$407FF1AE-B531-491D-8A64-C6C1A0E3A9A1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d4f9ca4d29db412f4c8e4933f601040d102a1d00","datavalue":{"value":{"entity-type":"item","numeric-id":3454624,"id":"Q3454624"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bc16239bb1c99d8dfd30a51b7e6b4f7f96cfec93","datavalue":{"value":{"amount":"+0.8698763251304626","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768025$6A10752E-01CE-40BC-87A4-D7D24BC94D18","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7f74ac1a8ddf1a18e03ebce7995228d04e808b6c","datavalue":{"value":{"entity-type":"item","numeric-id":4876723,"id":"Q4876723"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1990d220440505d59bc3cd778ea1e84d8bc2c1e9","datavalue":{"value":{"amount":"+0.8559910655021667","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768025$605C67AE-C064-4D00-869D-2E322CCB9686","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e9b6ee8cf35cc9ade210e509e5205c402872637b","datavalue":{"value":{"entity-type":"item","numeric-id":4876724,"id":"Q4876724"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4741af1966e9ab520b9a33417d411512ce38a61c","datavalue":{"value":{"amount":"+0.8557256460189819","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768025$12BC369E-3371-499E-926D-36FFFC3FD961","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4ce3183f034d83625c6fbcf651a52b3f9bbba07c","datavalue":{"value":{"entity-type":"item","numeric-id":2768028,"id":"Q2768028"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"acac0df54100c4d97e2756ccd7687a8a86b225c9","datavalue":{"value":{"amount":"+0.8557128310203552","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768025$BE92203B-88AD-4703-89EC-9305114DAA06","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"804c126cd3cf1029245e66c2b5a654df5dcea6b7","datavalue":{"value":{"entity-type":"item","numeric-id":3192104,"id":"Q3192104"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e2e68f75c5df058f5fd8d3a48b916a77fe1c2182","datavalue":{"value":{"amount":"+0.8300096392631531","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2768025$90E246A1-2FDF-4B2F-9331-DB1A53487EC3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parallel subgradient methods for convex optimization.","badges":[]}}}}}