{"entities":{"Q6517552":{"pageid":14096511,"ns":120,"title":"Item:Q6517552","lastrevid":40689896,"modified":"2025-03-28T14:43:09Z","type":"item","id":"Q6517552","labels":{"en":{"language":"en","value":"A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6517552$A1B0F116-BCB0-44F9-ADFB-D477FE85A0C9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"58201752a2c6494d96021648e82258910912c89e","datavalue":{"value":{"text":"A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6517552$F3BE9B26-3547-444D-A517-4E0DBDB9F986","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a41e9e6bdde4d9b8afc1b6f0eea2a0df0e55e721","datavalue":{"value":{"entity-type":"item","numeric-id":831267,"id":"Q831267"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517552$BF973066-8D82-41D0-88EB-8B2E58897585","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0de5b1e7e0aa829f011b5ccc1d9ff40a1700e791","datavalue":{"value":{"entity-type":"item","numeric-id":247032,"id":"Q247032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517552$FAB90660-C60B-46D4-BEA8-A2F1C674182D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a8f68013dc03385de9d6fc48098b85fa9512fee2","datavalue":{"value":{"entity-type":"item","numeric-id":237810,"id":"Q237810"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517552$11167D80-4AF0-4A86-8581-AF8BE3051208","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":"Q6517552$A2DA0D0C-DEA7-4BC7-BA57-9CB93FAF1754","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"111448397820af2923a9f9fa4485150305c0dd9d","datavalue":{"value":"2401.08211","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6517552$73330D4A-EEBB-46B1-82EB-602187DE3090","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"54cb3bf96b557020595b6e895c9b5b87d60e118c","datavalue":{"value":"https://github.com/xkchang-opt/pdac-linesearch","type":"string"},"datatype":"url"},"type":"statement","id":"Q6517552$8333BFE0-AE76-403A-9AFE-5A16B39576CB","rank":"normal","references":[{"hash":"5fda0ae9a2445105a1e008fc2c0597930d90bf3a","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"56c9bb78fc6b32068bca607efe1c67f318dd5c5e","datavalue":{"value":"https://paperswithcode.com/paper/a-convex-combination-based-primal-dual","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"24a5bedbb98b468462189ba0d6c16a88a2414cc1","datavalue":{"value":"publication","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6517552","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6517552"}}}}}