{"entities":{"Q1791410":{"pageid":1802152,"ns":120,"title":"Item:Q1791410","lastrevid":69367647,"modified":"2026-04-13T06:31:46Z","type":"item","id":"Q1791410","labels":{"en":{"language":"en","value":"A rank-two feasible direction algorithm for the binary quadratic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6950963"}},"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":"Q1791410$C167F480-896C-4AE6-913B-658AAFD6A1BB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d94d221f59cd572e2fb28189aa94134556c5e967","datavalue":{"value":{"text":"A rank-two feasible direction algorithm for the binary quadratic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1791410$0A5B7440-A493-4941-82D9-1E0B203921BD","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"19656e24d7eeeb51c818b9481d155902a232ad34","datavalue":{"value":"1397.90294","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$5E8B0D58-58A5-4376-8DAC-896BCA288D0E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a3a3bf2562a27993199f9354c46e5537b695cf2c","datavalue":{"value":"10.1155/2013/963563","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$86AE7398-3A92-4358-B5CA-20DBD16122B8","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"50268fa08fc579e85234f736c60219e3dc93e689","datavalue":{"value":{"entity-type":"item","numeric-id":279811,"id":"Q279811"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1791410$C7119E05-D867-4072-86B7-9F12916727B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ce77327c456f4bf0e4d7a62e8a49154b70d2a0d5","datavalue":{"value":{"entity-type":"item","numeric-id":336361,"id":"Q336361"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1791410$A15ACBE8-3940-450B-99ED-D78C976F6B48","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bb299feb2b87699ac8beef494c52fd2765eaf609","datavalue":{"value":{"entity-type":"item","numeric-id":118601,"id":"Q118601"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1791410$87B70492-FEC1-42BE-9F8C-7D28DE3455E7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9a9a21eafa993b72759052108b216b22ca406dd9","datavalue":{"value":{"time":"+2018-10-10T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1791410$B87CBAB5-07C2-4C52-B83E-46D6A64C3326","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ae8e60e8b34bc9ca094e9d13f97ea0837cda9dcb","datavalue":{"value":"Summary: Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation and yields a quadratic objective function with simple quadratic constraints. A feasible direction algorithm is used to solve the nonlinear programming. The convergent analysis and time complexity of the method is given. Coupled with randomized algorithm, a suboptimal solution is obtained for the binary quadratic programming. At last, we report some numerical examples to compare our algorithm with randomized algorithm based on the interior point method and the feasible direction algorithm on max-cut problem. Simulation results have shown that our method is faster than the other two methods.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1791410$E8F4BC28-AFA5-43B4-9785-79790444D577","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$ECAB6D29-35E0-4CC9-80F1-CF632F0A4CB6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"747ca2a29edc80ef77db4b4376cee27cb80d39e3","datavalue":{"value":"90C22","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$2E5F71F8-9B22-4B84-ABF5-759607908DC1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"db9aa7b55da22e13f846c4dcf1bcc6d59465be6d","datavalue":{"value":"6950963","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$4186146C-98B5-4AB1-83CD-F443FBB180EB","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"b1ead3f7a7537e0d6215129f1d5c1452a1c30dcf","datavalue":{"value":"Q59007211","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$0DB080E0-019E-4581-9CC9-B9DBF52E2EAD","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":"Q1791410$92CA04E2-F148-437C-8DA2-EC2201847457","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"f53fe15a23424fa2dda5ccb9ef911451859c2cfb","datavalue":{"value":"https://doi.org/10.1155/2013/963563","type":"string"},"datatype":"url"},"type":"statement","id":"Q1791410$9237EFE5-E7C3-4945-B65E-2362B16E931E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"1e6e44cba8a0432a1e8c0388f0ff9e9ff1820054","datavalue":{"value":"W2073941858","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1791410$92378444-705E-4F84-8680-80A16AED3162","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2720585a6d3c5f709b486a1e0d8ad6af0a9cd750","datavalue":{"value":{"entity-type":"item","numeric-id":3369951,"id":"Q3369951"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"65f916cc05e4217139ed87394807fad58f073a71","datavalue":{"value":{"amount":"+0.8301201462745667","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":"Q1791410$26CFBC47-8D42-465E-9BC6-7E01BA60AAF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"352b33b83df0ed6ec300b3fdbfd65f678f815c42","datavalue":{"value":{"entity-type":"item","numeric-id":3611430,"id":"Q3611430"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2c9f0571de1d4b062e41ad2e4f8a09ac1d0a31d6","datavalue":{"value":{"amount":"+0.812390148639679","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":"Q1791410$D97C56D3-1C69-48FD-AB44-DBA14F032C25","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b7ff460048edbce8d3ecd3d1dea7408e8b461124","datavalue":{"value":{"entity-type":"item","numeric-id":3156718,"id":"Q3156718"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3f9172272ec52ac301824efd9e64c076f3768773","datavalue":{"value":{"amount":"+0.8099277019500732","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":"Q1791410$C5080614-6C9B-4E15-925C-7416BA352B0D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fac1aede58b0e51c2070a7072f7da64ca94ab6e3","datavalue":{"value":{"entity-type":"item","numeric-id":2941668,"id":"Q2941668"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0a7fc9b7d038cda4bed30cfdff0c798988d84261","datavalue":{"value":{"amount":"+0.8086845278739929","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":"Q1791410$8715A67E-4753-494A-911E-9D0DD0BE6037","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fc879be5f3072639a4acef3bb9a5a89aeebed1ca","datavalue":{"value":{"entity-type":"item","numeric-id":3516589,"id":"Q3516589"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"edeb8d3f6fdaa7e979431ef2dc42d8ee6148e29d","datavalue":{"value":{"amount":"+0.7953699827194214","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":"Q1791410$E9E46B18-27A4-4DC6-ABEB-B7EAB207D5A4","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1791410$158FBA21-D890-4931-8D32-6FCA68F26331","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A rank-two feasible direction algorithm for the binary quadratic programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_rank-two_feasible_direction_algorithm_for_the_binary_quadratic_programming"}}}}}