{"entities":{"Q2748686":{"pageid":2759425,"ns":120,"title":"Item:Q2748686","lastrevid":79338938,"modified":"2026-05-06T13:41:19Z","type":"item","id":"Q2748686","labels":{"en":{"language":"en","value":"Solving convex quadratic programming by potential reduction interior-point algorithm"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1663345"}},"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":"Q2748686$5A0FECEC-E8F1-47CA-BD4E-D2B97709AFFE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"56ff02c88d87a25cf450a588f6222642576371fe","datavalue":{"value":"0978.90074","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2748686$AC9CC32B-705F-4761-978C-F0A7C3E6BA2A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"58b3fbb2e34c95d56d58376eeef65c4b810789ff","datavalue":{"value":{"entity-type":"item","numeric-id":224886,"id":"Q224886"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2748686$E18F03B5-620D-4A24-90E6-99A091E2C655","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4a8375e425ee88b5e9aded6c1a9cb0c02a14fe97","datavalue":{"value":{"entity-type":"item","numeric-id":2224013,"id":"Q2224013"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2748686$5AF4CE0B-208C-4CF2-B261-5DA03D1FD8EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b1a9809d891ece52866dbfac5410fac8d5da9eb","datavalue":{"value":{"entity-type":"item","numeric-id":946640,"id":"Q946640"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2748686$0C1F8FF8-A223-45A2-B62D-AF255FD20533","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"687f445f759c5c5a3ac9b7fec442c1cc4e4f6893","datavalue":{"value":{"time":"+2002-02-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2748686$5941199A-5760-4FF3-BA15-E2443F7ECA40","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2748686$015325D3-B594-438E-A45D-2E89A0383B7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ac3edbc9a781214f87fc7c9c04c2c17e13b7ca7","datavalue":{"value":"90C51","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2748686$C0FCCD91-42EB-4358-943F-3298021A0FC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2748686$C63B179D-05F4-4EA4-BD94-1ADE90202A44","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1df3e4036586ffbffe931c7d2727056eaad5e5db","datavalue":{"value":"1663345","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2748686$54081626-55C2-46A3-A6B5-7AC323FE1CAF","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7237cc02e73a373d6ef65b35303963937e5a4ec8","datavalue":{"value":"global convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$979FAD9B-2125-46E8-8AF2-4840A71254DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4a5ad9ff03b17c8457e1ed84ec13768350695ce6","datavalue":{"value":"numerical experiments","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$4C8859A2-72F6-4F54-8825-5BEF86C5CC0F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2530ad92bf57ad49c3a9ab88a408f45d644be85f","datavalue":{"value":"convex quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$D2F107E1-75D4-4BEE-B9DF-9DDE1C70B381","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e30d369bec9a50a547fe443c6421c3f91da7ba4f","datavalue":{"value":"potential-reduction interior","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$846C9026-B16D-4A64-B802-AEA1C0D9FFBF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd7165472ea4c07a1c09d7244764644a8a935e4a","datavalue":{"value":"point algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$CEBE1077-9F8A-487F-AE09-4C111D5E2148","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":"Q2748686$25BBB8F3-08B4-4729-86D0-2ABD8561937C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9f95b5be9309a2ee1761858cd013b3e9f3805d5b","datavalue":{"value":{"text":"Solving convex quadratic programming by potential reduction interior-point algorithm","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2748686$BDA4013E-BEA2-4FDE-8DB9-B4F285B0FA34","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0792788a6d6549c16ec9bb27a6ec3867c23c7ee1","datavalue":{"value":{"entity-type":"item","numeric-id":6768454,"id":"Q6768454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2748686$FADC9645-60DD-4294-BA21-CB58B4F03165","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c5b2d421a57f9752881ca034c31d0df6a23688b8","datavalue":{"value":"We solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2748686$F77114DD-4525-493B-BB47-5E5DE69C9744","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solving convex quadratic programming by potential reduction interior-point algorithm","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Solving_convex_quadratic_programming_by_potential_reduction_interior-point_algorithm"}}}}}