{"entities":{"Q1079495":{"pageid":1090247,"ns":120,"title":"Item:Q1079495","lastrevid":69592740,"modified":"2026-04-13T08:03:54Z","type":"item","id":"Q1079495","labels":{"en":{"language":"en","value":"Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3963566"}},"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":"Q1079495$9D982C22-A331-4003-89F1-D9F33959CD96","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a8bdb310ac3c41c69e76fe94566a48d604b550f8","datavalue":{"value":{"text":"Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1079495$14CF8FD5-89B5-45A2-85A8-E01958F09C20","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0e81c80a10a52b1e6db2db907e818f465b66b335","datavalue":{"value":"0597.90060","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079495$D5BACEDB-382C-408C-98F8-BA54BCF89B4C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"83acb26c132edffe3503227fdedd09777c685939","datavalue":{"value":{"entity-type":"item","numeric-id":1060191,"id":"Q1060191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079495$D04C5AAC-9896-4C5A-AB5D-B98635E46E4E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"07c876e6223b6f7e45c6ea730b8b78c5772aad81","datavalue":{"value":{"entity-type":"item","numeric-id":260460,"id":"Q260460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079495$DF405551-EB30-47EC-B6DC-642DB69B278F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1079495$37AAD137-6DD8-44F0-9120-3460E019D892","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"d55aa63f197a0174cf1a8b26c40531205f203fea","datavalue":{"value":"The paper studies two algorithms for approximately solving convex programs when function values can be computed only approximately, but an \\(\\epsilon\\)-subgradient is available. Such type of problems arise for instance if integer programming problems are handled by formulating Lagrangian dual problems. The second section gives a review about integer programming problems, in which \\(\\epsilon\\)-optimal solutions of relaxed Lagrangian dual problems were be applied successfully in heuristic methods. The third and fourth section contain the theoretical basis of the algorithms to determine Lagrangian \\(\\epsilon\\)-subgradients. In the first algorithm an inexact solution of a relaxed Lagrangian dual problem has to be determined, whereas the second algorithm applies cutting planes.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$67B1AB11-B2A2-426A-BBBD-6AD4ABEE69FA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079495$AB2BA97C-D154-404B-B0C7-CA7FC7E54409","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079495$EFE28CD1-14B5-4062-861F-B72184AD7FE0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079495$73EA4C72-F717-4EC9-9922-E3362F621ABB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4564e1d83a1cdbb1b7ddfe7ceac24f7ac9906fc6","datavalue":{"value":"3963566","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079495$546D38A5-EE0A-4A55-86F9-6850FCEF5D11","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"66af9a14413e081424113521e0710ff94d8fdc3c","datavalue":{"value":"approximately solving convex programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$7D177378-3AF3-48C1-8805-EAABEA528094","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eec9e275388041d8f94557323dcabca4a0e50297","datavalue":{"value":"\\(\\epsilon \\) -subgradient","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$759AA02D-9044-4CF0-9EFD-7B6EB57EEF35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"20ba847c01057aef23010699a1d1f9723dd604ac","datavalue":{"value":"relaxed Lagrangian dual","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$DE5A1DE7-8254-4947-8FC9-4631E649447F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f641bd239fe6f0d5fb2cc0d2b3f89cbc609bab87","datavalue":{"value":"heuristic","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$F4809579-7FA7-4213-8131-18C225C50A2C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"be3f5c88d3db777a4bdd3348a5d62b7e04a937f6","datavalue":{"value":"cutting planes","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079495$4D8C790D-7FD7-4F3A-BA91-CB4BEFF9D88B","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":"Q1079495$A0AEC699-3485-446E-A3F4-3D584E969192","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a2b26951df26e024920891f1da64fb74645b3946","datavalue":{"value":{"entity-type":"item","numeric-id":3771978,"id":"Q3771978"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"58656dd81491037ae2c750ff26be8f55e3a0cee7","datavalue":{"value":{"amount":"+0.8170732259750366","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":"Q1079495$D6AE7A80-02AB-4FCB-8446-F8AFEA9FA6FD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"384a76894130543c98c7f0ddd9e4d6b69ffc950b","datavalue":{"value":{"entity-type":"item","numeric-id":5470229,"id":"Q5470229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e2349e46ef636389c2961a0474f4b35c3e9290f5","datavalue":{"value":{"amount":"+0.8038064241409302","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":"Q1079495$6D556FF2-4A6A-45F1-94AD-0E747B557E85","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2ac75f0ac464ff2310345b400e9f87ae5cc178b0","datavalue":{"value":{"entity-type":"item","numeric-id":2429403,"id":"Q2429403"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4e4f5e3c4cb652779afe7c6ac33a234bb926dc5e","datavalue":{"value":{"amount":"+0.8030542135238647","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":"Q1079495$B9859E81-5078-420D-8747-C60CE87BA84A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3a7e0d84e609a1fbfff359e2cca434fabbbfdcf4","datavalue":{"value":{"entity-type":"item","numeric-id":1961980,"id":"Q1961980"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fcb31e2fa2856455c35477c7dcb46fae2373c969","datavalue":{"value":{"amount":"+0.7982015609741211","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":"Q1079495$B4FA1088-8A57-4268-BD87-D171F28A0253","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"173027d5c08a528796df04c03977e4c9787bf8f0","datavalue":{"value":{"entity-type":"item","numeric-id":5202852,"id":"Q5202852"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f98ba79c2b01201c7d70e7cf87cb8245684bd424","datavalue":{"value":{"amount":"+0.7951046228408813","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":"Q1079495$3E572EEC-098A-4E0B-A721-1C7EDFD11E33","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Epsilon-subgradient_optimization_techniques_in_convex_programming_and_Lagrangian_duality"}}}}}