{"entities":{"Q2913902":{"pageid":2924622,"ns":120,"title":"Item:Q2913902","lastrevid":85087328,"modified":"2026-06-03T05:50:02Z","type":"item","id":"Q2913902","labels":{"en":{"language":"en","value":"Short-step primal-dual target-following algorithms for the convex quadratic problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6085198"}},"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":"Q2913902$A588C3A5-BCBC-4830-B5AD-4D3F90185DEF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ee119b275e4b814ccc73a991c2e794dbca3754c8","datavalue":{"value":"1253.65097","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$3CCE7AF4-29F9-4AE6-8C64-AB22C9E11907","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a11df75ae5f7bcee06e8e35ec102e00204c7226b","datavalue":{"value":{"entity-type":"item","numeric-id":2913901,"id":"Q2913901"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2913902$AB51B83F-D5BC-47BC-A660-2620244CAAA1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9be54b5bf8411b172b987b968e66cf4985f4b2f8","datavalue":{"value":{"time":"+2012-09-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2913902$0213D13E-37B2-440F-90BC-49D806251D8F","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"9ea40bd5740be1938409dde0401fa514a80f8492","datavalue":{"value":"http://www.ijpam.eu/contents/2012-77-3/5/index.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q2913902$C18B5333-B31E-40E9-A22D-D061130A288A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$49C1A5BF-1D9F-4804-AB62-3B0B744C1357","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$01E9BC14-75D3-4580-AEDA-CBC1C2964BC0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"4ac3edbc9a781214f87fc7c9c04c2c17e13b7ca7","datavalue":{"value":"90C51","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$08373A3A-E8D5-4A8B-9257-99222D5DBC0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$1C32D6EF-7395-4F28-94AA-8D3196EE9E91","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bd4715de5daba24a33818b6788c4ca704f8b7d86","datavalue":{"value":"90C53","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$752379E7-C3F4-459B-A75D-2F80B09E3632","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"093b896b34eaa3ac7d869f3568ab5435f4a37f84","datavalue":{"value":"6085198","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2913902$9965F089-AF4A-4951-A3F6-E25C9A22FC0A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5e71ce3dbbcdf8c0c80bd335aa5d39a416fba96a","datavalue":{"value":"interior points methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$BD4786A3-1715-464B-A2A7-C1D59330731D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2530ad92bf57ad49c3a9ab88a408f45d644be85f","datavalue":{"value":"convex quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$14FB3543-F836-4F9F-A660-442E81DBCFB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"08306d70e60b5e4713011f77e69df4cb51787ed0","datavalue":{"value":"short-step method","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$A8720BB6-3621-4823-BCD1-30327941FAC6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5f9d29a1d4aa87f0ecfc5c0564286b7881dc83ba","datavalue":{"value":"primal-dual target following algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$17136D8C-45AD-4B88-A17B-2E8445654D42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"267b394071cf1b5b643cd515aabcdbcae8c08f98","datavalue":{"value":"polynomial complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$A6404D51-B25C-4799-BCB1-269CEFC3023A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1736cb68dc4e94b68b37018132c473552b61bdfc","datavalue":{"value":"Newton's method","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$5B98DBB7-2E21-422A-9C31-F5B37664C6FF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37318345779707692012b8c7959755f9c69b2691","datavalue":{"value":"numerical example","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$745A9CAD-E9D6-47AB-8AC0-55BB24DC6EF9","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":"Q2913902$E72B83DE-EE52-47D9-8A9E-72D1D9E906E9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b42239b43be3fcf667d4c7a693645c9b65d0f152","datavalue":{"value":{"text":"Short-step primal-dual target-following algorithms for the convex quadratic problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2913902$E6282FEE-B1B1-4B2D-937A-8B02BF49E93C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"11c40f6060ee2677ebfa525a6ed2c2188c8dc1f0","datavalue":{"value":{"entity-type":"item","numeric-id":6773427,"id":"Q6773427"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2913902$3F84F53C-01E9-46C3-B9CA-7060239F2557","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f454ff7c1ccb45386967d1263869a28c9b6bd4a9","datavalue":{"value":"A primal-dual target-following algorithm with polynomial running time for solving convex quadratic problems is developed. The approach is a generalization of linear optimization for linearly constrained convex optimization. A new class of search directions by applying Newton's method is defined. A numerical example is used to show the implementation results of the algorithm.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2913902$7DDDA43C-2D8C-419C-9699-B5A0A96ED644","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"033ae98111ea4a4d9ccdc87e4e91c764fa7980d1","datavalue":{"value":{"entity-type":"item","numeric-id":921953,"id":"Q921953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2913902$D6AEA7BF-D817-437B-8B5A-1D3D656FB7C4","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"42554b007bbc251e4d97f7f8dbc3d0ccd3031bd4","datavalue":{"value":{"entity-type":"item","numeric-id":2858217,"id":"Q2858217"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e212d5d6f595c190c121225fee63e93db42d86f3","datavalue":{"value":{"amount":"+0.8271879553794861","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":"Q2913902$B603BBDF-BA9B-49FF-8169-3254A0F14F86","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"34cf3d469a652c352ff05671c4ccb9896e638fa1","datavalue":{"value":{"entity-type":"item","numeric-id":539783,"id":"Q539783"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2e521f478f6d2f62347921ef3309c954bd1d1b92","datavalue":{"value":{"amount":"+0.824440062046051","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":"Q2913902$D618AB43-71A4-4DCC-8B28-441F7CCCC251","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1643c9a2b17184519c8c0470bc86a3914b6c459f","datavalue":{"value":{"entity-type":"item","numeric-id":1123122,"id":"Q1123122"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b1642c46d477223b34348d31f59478112c0bec69","datavalue":{"value":{"amount":"+0.8168227672576904","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":"Q2913902$BC602E86-805C-46F6-801A-30D785B99720","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f821d581bbb16020c376e08e3529b90ebeedcb10","datavalue":{"value":{"entity-type":"item","numeric-id":3200887,"id":"Q3200887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"419e01d45966061d52f1e28308be6db889cd9475","datavalue":{"value":{"amount":"+0.7920641303062439","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":"Q2913902$D6A2F14C-A77B-4E28-BA33-9AE3A1D559A0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f971f95ad8afacaf2cc6d28aa0de6b50027514c7","datavalue":{"value":{"entity-type":"item","numeric-id":1915912,"id":"Q1915912"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"17347091ac6d38108d037dbc2256f1b921499046","datavalue":{"value":{"amount":"+0.787826657295227","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":"Q2913902$250675F2-C142-47F9-A2EE-9F0351ECB0E7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Short-step primal-dual target-following algorithms for the convex quadratic problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Short-step_primal-dual_target-following_algorithms_for_the_convex_quadratic_problems"}}}}}