{"entities":{"Q6514307":{"pageid":14093266,"ns":120,"title":"Item:Q6514307","lastrevid":99713342,"modified":"2026-06-05T20:33:31Z","type":"item","id":"Q6514307","labels":{"en":{"language":"en","value":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming"}},"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":"Q6514307$0653874C-B3A3-4E1B-A552-60CED60DEA1E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f95d94fcb3e9d17895c2e67156572568eb921f01","datavalue":{"value":{"text":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6514307$1BAD5A39-5EAD-445C-9849-AF7F9C45E5F6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"42f9ed3d6c85b2f79d08c1ca1cc48f435a9de251","datavalue":{"value":{"entity-type":"item","numeric-id":1659677,"id":"Q1659677"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6514307$ABAB91C1-53E0-40C5-A54B-0CB1A22A5443","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"87ac959c86bc249c04560b6b70e5c5db5e9a87c5","datavalue":{"value":{"entity-type":"item","numeric-id":6120840,"id":"Q6120840"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6514307$DCCD14FD-839B-413D-8682-3BDABE70BC76","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":"Q6514307$8150E6DF-E4BF-41AC-92D6-106716AA9BAF","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"cd648351a7f0967d05f0de354d8eac61b67cd58c","datavalue":{"value":"2311.07710","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6514307$64ECAD0A-8C41-4F15-A257-2103E057DF19","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"61e71dc8cccc36d993fedb922b5de126261987ee","datavalue":{"value":"https://github.com/mit-lu-lab/mpax","type":"string"},"datatype":"url"},"type":"statement","id":"Q6514307$C0A94AE5-F4F0-4FA2-AAD0-FDEE494C965A","rank":"normal","references":[{"hash":"dc87a4e11d36d3e72f1692b8ce6065e7d6a8c397","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"e69fe0e0c827c495a20e5a85dc05ba66b4942483","datavalue":{"value":"https://paperswithcode.com/paper/a-practical-and-optimal-first-order-method","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"f846dfc57207c7640d2726d8f72d9e8a317f0bcf","datavalue":{"value":"repository README","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Practical_and_Optimal_First-Order_Method_for_Large-Scale_Convex_Quadratic_Programming"}}}}}