{"entities":{"Q2762845":{"pageid":2773584,"ns":120,"title":"Item:Q2762845","lastrevid":83214965,"modified":"2026-05-07T06:40:15Z","type":"item","id":"Q2762845","labels":{"en":{"language":"en","value":"An algorithm for solving convex programs subject to box constraints"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1689555"}},"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":"Q2762845$4D96DA6B-1A4F-42F9-B0CA-0B7C6C12092E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d22de6fc7992fe6a9a36358d81ebe1aac99ca9f8","datavalue":{"value":"0999.90028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2762845$092018C3-091A-4B9A-82AF-E07554E78972","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"f6f6bc7d2653a2080fd59a65c086c7dd96b12e6d","datavalue":{"value":{"entity-type":"item","numeric-id":2734134,"id":"Q2734134"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2762845$42D6EDDB-CB40-4989-9443-0FAD865FF599","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a2a8ca8cbf5c55bfc4293641b2829749d0fe1233","datavalue":{"value":{"entity-type":"item","numeric-id":488633,"id":"Q488633"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2762845$E82D10F0-60A8-4378-875E-8290D58FC23E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1a37edc53ddbd07c5bb359ac05d865dd55164d4d","datavalue":{"value":{"time":"+2002-01-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2762845$5995B918-544B-4942-B304-1C2AC80834B7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2762845$19A0ABDB-AAA2-4F6F-BB81-BED54C4AF56E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8a5a26c91917c8825aedd8ea6d5145feb93100c8","datavalue":{"value":"1689555","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2762845$6EB1E959-58B8-4EAA-96BE-C5CA727EFF14","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6967e67113aaa139c1c0b5c2a96849f0ad345afa","datavalue":{"value":"convex programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2762845$6C72FF98-BB29-4877-BD54-DE5DA3760C0A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"91c1b32630dcf4f59c0c82afe3a345100d204d14","datavalue":{"value":"box constraints","type":"string"},"datatype":"string"},"type":"statement","id":"Q2762845$4230F80C-436C-4857-847F-49386298F4F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c636984428789ff4a097a77ec5ca7a0c9a8b0a59","datavalue":{"value":"iterative methods","type":"string"},"datatype":"string"},"type":"statement","id":"Q2762845$4A0DFCA7-986B-4FD4-B8F8-FF688D5BD263","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":"Q2762845$F09F30C8-C4AA-4D58-B56B-96FEFDD85621","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d9ac3e926f7266737b7ab80e223f1233cb926571","datavalue":{"value":{"text":"An algorithm for solving convex programs subject to box constraints","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2762845$97FD5759-35F8-4ACF-BF23-37F410F8A647","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ae3fbffe9fd5186d247b3611ebb4df51cb7bb84c","datavalue":{"value":{"entity-type":"item","numeric-id":6769251,"id":"Q6769251"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2762845$9A6286F1-7FF9-4E6A-ADB2-E8BBAF7ECEAF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"5750e415858dbc0c22da1f8bca49788f2d066e0e","datavalue":{"value":"There is proposed a method for solving convex programs with linear constraints and bounds on the variables. The algorithm finishes in a finite number of iterations.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2762845$C6A4A109-5341-4AB5-9E05-72C58D7E3984","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"7d7f3e3add9d024f2b0d08efd30b0cd30b5413c9","datavalue":{"value":{"entity-type":"item","numeric-id":587981,"id":"Q587981"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2762845$D4924C78-067E-4ACE-9F7D-F9BE44A5326B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for solving convex programs subject to box constraints","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_solving_convex_programs_subject_to_box_constraints"}}}}}