{"entities":{"Q1180839":{"pageid":1191588,"ns":120,"title":"Item:Q1180839","lastrevid":66779898,"modified":"2026-04-12T12:48:26Z","type":"item","id":"Q1180839","labels":{"en":{"language":"en","value":"An algorithm for indefinite quadratic programming with convex constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 30042"}},"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":"Q1180839$9DAF3B0A-8C2B-4F0B-BB8E-5965D312343D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"192d17b405361eb72a92b2f31794ed86e98ca390","datavalue":{"value":{"text":"An algorithm for indefinite quadratic programming with convex constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1180839$13EAEC8E-F1E0-4FE5-84DD-1804477BE965","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"87bb106a6d20a8e09666739c029d28aa0cb3b9c5","datavalue":{"value":"0748.90049","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$D226EF71-67AB-468F-9C47-85C91E0559A0","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2b71b3c6f581e1c15bdf4ab0b9ee4bb81e5f2f6b","datavalue":{"value":"10.1016/0167-6377(91)90004-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$B24E5F3C-0D9F-4744-BB36-F560BA762381","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f9747a37b0b56aeca2085282046e2737cd5087ca","datavalue":{"value":{"entity-type":"item","numeric-id":96289,"id":"Q96289"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$2A7AF887-0972-47AD-AE9D-A10524C0DC38","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"70844ffc4666eabac4e20376c648613dbe8620f7","datavalue":{"value":{"time":"+1992-06-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1180839$19E0F31C-601D-4134-9561-9B80E6411BBF","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e383533523965fdc334763db9478f218ce0f067f","datavalue":{"value":"https://ub-madoc.bib.uni-mannheim.de/1976/1/1989_89.pdf","type":"string"},"datatype":"url"},"type":"statement","id":"Q1180839$15B30EB7-B60A-4271-823D-E09500DEF1EC","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f7f6e8cddb7cdce0f03f7d861bc5f303f884f4fa","datavalue":{"value":"The authors present a new branch-and-bound method for solving the following problem:  \\[ \\min(f(x,y)=p^ T x+x^ T My+q^ T y: (x,y)\\in S), \\]  where \\(S\\subset R^ n\\times R^ m\\) is a closed convex non-empty set, \\(p\\in R^ n\\) and \\(q\\in R^ m\\) are given vectors and \\(M\\) is a given \\(n\\times m\\) matrix. The branching here is a simplex bisection and the bounding operation is connected with the solution of \\((m+1)\\) convex subprograms and in the case if \\(S\\) is a polyhedron these subprograms are even linear.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1180839$38717862-261A-44DA-9CB4-9FADCA512040","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$1E5AE306-3093-404B-9EE6-B0B2E1FFCDA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d550400b67148ac150a943881fbd05e682ea56f5","datavalue":{"value":"90-08","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$69E837A1-0CC6-4E7F-97E6-4D02A946AE73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$84B465F9-E1D1-4FCA-8B61-FFE1512C8215","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ad0bab1b67a2898315ed9f5d9f1fd3d6a1a749af","datavalue":{"value":"30042","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$75349797-2CAF-4B6D-BCE6-A79E33C37689","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"32b70193b15cfa9820eaa83513ddb2267d9b694a","datavalue":{"value":"branch-and-bound","type":"string"},"datatype":"string"},"type":"statement","id":"Q1180839$3DE7C821-21A3-4566-874B-9FF24F9DD185","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ecf65431316b32d32367d128185ed6660113059","datavalue":{"value":{"entity-type":"item","numeric-id":312191,"id":"Q312191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$C42A8EE9-3A27-4318-A92E-14E9F459626A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e9c6b72ea7f96180d9ddf9f80ec53498230d9cb7","datavalue":{"value":{"entity-type":"item","numeric-id":917853,"id":"Q917853"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$69E6976B-86D4-49D8-907D-4EFBC93344AB","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"aa21eb4a5f5298b19ccea5af22e06ff7d906b4da","datavalue":{"value":{"entity-type":"item","numeric-id":705713,"id":"Q705713"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$37CB1C21-6C59-4AB2-88AE-5FE17754C5D5","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":"Q1180839$6C70815A-B1A7-43D2-B0DF-F341437F0901","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"727c5b442e649114e6c4b40547013656f4bc6f4a","datavalue":{"value":"W2029877367","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1180839$3BBA5E31-983E-4CC2-AD13-4DA17FFF99F0","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"58d42b0da8e8b6439dce8b581304ec66d4dc34e1","datavalue":{"value":{"entity-type":"item","numeric-id":3671770,"id":"Q3671770"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$19456EC0-A700-4D98-977E-06452A6F3E81","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e4426ff365911facdf82d95a35fabf13d8d1d91c","datavalue":{"value":{"entity-type":"item","numeric-id":4105518,"id":"Q4105518"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$C0506FFD-5770-47C7-846F-41307AB6B1DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"bcb0e5d45404efe41a1081f6b29a1cf7ceeb92c3","datavalue":{"value":{"entity-type":"item","numeric-id":1102872,"id":"Q1102872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$A6A2B375-E8F6-45B6-AB95-DB89BFBD0010","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5d9278c22c170fbf7ab2ef157aff9ab68ae2346b","datavalue":{"value":{"entity-type":"item","numeric-id":1099780,"id":"Q1099780"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$24A0C12B-A0D7-44A7-8163-01DBA7399E8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"756473e6927531d6da8043893ed24b5513260b8d","datavalue":{"value":{"entity-type":"item","numeric-id":4045187,"id":"Q4045187"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1180839$4728CC36-B219-4D1D-B2B0-BB6E4CA29C18","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"89f3d1fb23044ee72e803bb96688a7b503f10808","datavalue":{"value":{"entity-type":"item","numeric-id":2641219,"id":"Q2641219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"42fc8cc59a86c2813809c3105d4b4cd29d1c198f","datavalue":{"value":{"amount":"+0.8862022161483765","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":"Q1180839$81012860-0874-4AC9-AE88-135A25FE607E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b92d0e2e00c9b4f1e370d556250e50680d1b922a","datavalue":{"value":{"entity-type":"item","numeric-id":3573866,"id":"Q3573866"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"17f1df8f586d142b47f6df792ef169a195dd62df","datavalue":{"value":{"amount":"+0.8454127311706543","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":"Q1180839$54B55F64-33F0-4B19-BA26-BF62801CC9DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"09d712ea82764cfb173c349f7a26e1faf6793bd0","datavalue":{"value":{"entity-type":"item","numeric-id":3017743,"id":"Q3017743"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bf711b224641efb7fd7fd9ae9bf1f8de98f394fb","datavalue":{"value":{"amount":"+0.8316723108291626","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":"Q1180839$FB8F596D-E00A-4B33-BF74-76403CFC312F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"896657166dd668a7cfd18b8e22d043027f6d6275","datavalue":{"value":{"entity-type":"item","numeric-id":4550783,"id":"Q4550783"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2b628f0638e2498e45b613682bb1dd87347768e8","datavalue":{"value":{"amount":"+0.8258445262908936","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":"Q1180839$F7B8F675-2305-4C42-B77D-2D4B84806986","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"11c6ebdc5e3343eec9e72ca2f7f520d2be931f0c","datavalue":{"value":{"entity-type":"item","numeric-id":2713937,"id":"Q2713937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0c115869c02ea10413a37123ae59db945deea69b","datavalue":{"value":{"amount":"+0.8245395421981812","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":"Q1180839$EB69CEF3-A612-4F37-A8CE-14C9614D3B47","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for indefinite quadratic programming with convex constraints","badges":[]}}}}}