{"entities":{"Q1078076":{"pageid":1088828,"ns":120,"title":"Item:Q1078076","lastrevid":66827892,"modified":"2026-04-12T13:08:01Z","type":"item","id":"Q1078076","labels":{"en":{"language":"en","value":"Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3959136"}},"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":"Q1078076$ED097906-CCB2-46FE-A1EC-35DE96E8469A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"765aa60b93ae9c1adaa49bfcf9cea48f80b889fd","datavalue":{"value":{"text":"Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1078076$536BA4A8-9D6A-4982-9826-4DC8571F5A85","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7083da7145307ca7e2ff25a5a78478d2bb1ea29d","datavalue":{"value":"0595.90069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$EC906A66-1E6D-4AD2-A3B4-3952FC2B65E5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a4a4a0beca1a3d0f1fd9821cb454b45988efc253","datavalue":{"value":"10.1007/BF00939216","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$E8CB464E-D5E9-4533-92AB-B5582B7D9EE7","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":"Q1078076$A6213131-ADAD-4924-9A67-15C0BB9E2695","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a3c8bf4d8569c126380a9fc42f55609089e776fb","datavalue":{"value":{"entity-type":"item","numeric-id":82026,"id":"Q82026"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$E90D5863-B4EE-4E6E-AD02-9AA2281EC210","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q1078076$6E265DEF-CE86-46C3-A82A-54EF6F46D48C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"4c03d041fcad2b17627f10fb8b51b6a4886a7328","datavalue":{"value":"A new dual gradient method is given to solve linearly constrained, strongly convex, separable mathematical programming problems. The dual problem can be decomposed into one-dimensional problems whose solutions can be computed extremely easily. The dual objective function is shown to have a Lipschitz continuous gradient, and therefore a gradient-type algorithm can be used for solving the dual problem. The primal optimal solution can be obtained from the dual optimal solution in a straightforward way. Convergence proofs and computational results are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$C64F6EB8-91C9-44FF-8B0C-A86784D5329B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$4C0B2A6A-1F96-4B30-A35C-38FFBD80582E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$BC678AA4-2832-41DB-A468-F0F486AB6637","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"c562ee8daf10183438dc5f4f8a927d99548d37df","datavalue":{"value":"90C55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$429950AA-47D0-4B92-B485-C1CFE34F5767","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f004eccb107e32ba1d30cf875e9c18e8ded41bc7","datavalue":{"value":"3959136","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$975EEBC5-D50F-4414-99C7-8844A4195251","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7c4e942bbc833b6515a96a0022a267eff6b5ffac","datavalue":{"value":"dual gradient method","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$FA31BC61-ADB2-43EE-A715-C01A6FFB1574","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f23a408dc86cead84c558121b3c5d574973ce918","datavalue":{"value":"linearly constrained","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$7289B022-2A69-4864-A7E9-00E6FE7502E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a158b43f3171fe5ecf3908c36c9be55184417cde","datavalue":{"value":"strongly convex","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$18201953-E016-43E6-982F-AD53E6D51007","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"112e94ce5d7375dde0e5b7197a78ea60174f61c8","datavalue":{"value":"separable mathematical programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$75454AA3-90E3-43DD-8ABD-8635A537223F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1a13a1ff530d9cbec5f3a52163e060d0d6cd0eee","datavalue":{"value":"convergence proofs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$875D2365-2831-438F-BAAC-D776A8F48CB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73365890b656e44b2869c576d0348e365daaf23f","datavalue":{"value":"computational results","type":"string"},"datatype":"string"},"type":"statement","id":"Q1078076$9D0EDF4F-6162-4C6B-B95F-BC629EC6E2FE","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":"Q1078076$7E651918-A508-408D-A8FF-92BF15207BC7","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"230a92fbc65056443cabb7efce04cbec6c275c43","datavalue":{"value":{"entity-type":"item","numeric-id":4154386,"id":"Q4154386"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$F3BC2C5A-597A-4250-836C-2BFF1220E71B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e9287cbcfd545c8a0b609b7e99b58e99a8903c00","datavalue":{"value":{"entity-type":"item","numeric-id":4180171,"id":"Q4180171"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$B38FAEC0-FF79-4D81-9BC6-B76E801B49B1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"32fc1af0979ef72fe48f4741aefb530df2a37801","datavalue":{"value":{"entity-type":"item","numeric-id":3934118,"id":"Q3934118"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$6F7E97CC-73EE-496A-AC4B-46FA94710861","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2886457c684e71a7e026b5910cf944171a750d6a","datavalue":{"value":{"entity-type":"item","numeric-id":3668258,"id":"Q3668258"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$B0E08189-F4A2-48C5-BEAF-5132F425F516","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8bea7828a4f88474614a0a37a4be80d1ae17b020","datavalue":{"value":{"entity-type":"item","numeric-id":5641019,"id":"Q5641019"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1078076$1601A98F-90B3-4354-8949-A20F66BDE165","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"1ddc90820e0b9c6fb0966e32db05caa20c083b5f","datavalue":{"value":"https://doi.org/10.1007/bf00939216","type":"string"},"datatype":"url"},"type":"statement","id":"Q1078076$0112FEA3-3D6B-4AB9-945B-9DDF4D792EA5","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"8142888e89b24eb5927c39bfd649d5707c8426b3","datavalue":{"value":"W2016799959","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1078076$9EBBBC23-AE8C-4D6D-8E85-3E50128A4F0C","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cd76853e3b376abe3f31d7bd313b686f08071fc4","datavalue":{"value":{"entity-type":"item","numeric-id":3680618,"id":"Q3680618"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f5f1225919f5a7072d23a8ef05a9afe04750d032","datavalue":{"value":{"amount":"+0.8175801038742065","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":"Q1078076$FDFABBE2-17F2-4D90-B1B8-DBDC4465DF42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dc3c7924a31fadb25e1f9b3c9269169fe21192c8","datavalue":{"value":{"entity-type":"item","numeric-id":2813610,"id":"Q2813610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3756b4197d51334086c9b2fead9b34d55bd5a1fb","datavalue":{"value":{"amount":"+0.8128851056098938","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":"Q1078076$62B904FD-616D-4394-978F-18920770EE46","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d7fc93f03b3da998b4f7c25803e15f221ed83ec5","datavalue":{"value":{"entity-type":"item","numeric-id":5387987,"id":"Q5387987"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ba1f5de1a414b128bd7dff57bd1b6a2e7b969403","datavalue":{"value":{"amount":"+0.8088787198066711","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":"Q1078076$BC51D7A7-9758-4B4A-828F-49EA61C10E9F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"78b9cf963eda536e5a5a4cc82a064000ce854fb8","datavalue":{"value":{"entity-type":"item","numeric-id":3680617,"id":"Q3680617"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"823a74da3eed691efd6152ccbcb080b7da32cf17","datavalue":{"value":{"amount":"+0.8033798336982727","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":"Q1078076$4A58B2F0-6E2B-4C08-9756-966BF335BBFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3e06029cd06cfa7ee6a825d669a5d23fc3be8ba3","datavalue":{"value":{"entity-type":"item","numeric-id":1689375,"id":"Q1689375"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6663b7d43957a5674a255cee7a0d0c1f51f15181","datavalue":{"value":{"amount":"+0.7982531189918518","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":"Q1078076$B1A8970F-BD09-4B4E-9B7C-FFE4063CF78F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Dual_gradient_method_for_linearly_constrained,_strongly_convex,_separable_mathematical_programming_problems"}}}}}