{"entities":{"Q1348544":{"pageid":1359283,"ns":120,"title":"Item:Q1348544","lastrevid":68799822,"modified":"2026-04-13T02:08:25Z","type":"item","id":"Q1348544","labels":{"en":{"language":"en","value":"On an approach to construct continuation algorithms in global optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1740009"}},"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":"Q1348544$B09F808F-E01E-4E8B-8268-D44120A626EB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bbc68eab20a92d85319d161f6c6e0090f3f12aac","datavalue":{"value":{"text":"On an approach to construct continuation algorithms in global optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1348544$3E3832E4-6F19-4792-82BB-56FA8AAAC5E5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b6ac6bb999b384f763ab0334c0228e7ae7903db1","datavalue":{"value":"0996.90069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348544$C825B072-8A4E-45E9-9D2B-D869E55459AF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"78f3492c1672bc0190a7908a503f8e56e5017582","datavalue":{"value":{"entity-type":"item","numeric-id":246932,"id":"Q246932"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348544$C9D076BE-6F71-4029-AFE3-716FC5738C70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f706410f19d43d70a35bc666e2a2092e90a2b8f8","datavalue":{"value":{"entity-type":"item","numeric-id":880657,"id":"Q880657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348544$0199ADE5-1CE2-40A1-A345-FC0C3E0FFEB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1c492b6975f92a37a1f39c7a916a8351852351a4","datavalue":{"value":{"entity-type":"item","numeric-id":880658,"id":"Q880658"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348544$E8E99960-AA40-42DD-8770-B4514937BF81","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"aa4e0e353121dae82cdaefca14a62dc9d4bb34af","datavalue":{"value":{"entity-type":"item","numeric-id":163582,"id":"Q163582"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348544$BA9419B7-22C6-462C-9AFB-D685CC3647C8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"05d02d494e311c112f365e2abe0dc31f2e442bf8","datavalue":{"value":{"time":"+2002-05-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1348544$BCB76332-CF19-4504-9BAE-B25463CE7CF4","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"72da403403bfb39c9b1c547fdfa4fc78c96c1d9a","datavalue":{"value":"The problem of global minimization  \\[  F(x) \\to \\min_{x\\in X},  \\]  where \\(F(\\dots)\\) is a twice continuously differentiable function on \\(X\\),  \\[  X= \\prod^{(k)}=\\{x=(x_1,\\dots ,x_k)\\in {R_k} \\mid 0\\leq x_i \\leq 1, i=1,\\dots ,k\\}=\\bigotimes_{n=1}^k [0. 1].  \\]  is considered. The following notations are introduced  \\[  X^{\\text{opt}}=\\arg\\min_{x\\in X} F(x),  \\]   \\[  X^{\\text{lopt}}=\\{x\\in X \\mid \\exists \\varepsilon>0:F(x)\\leq F(x'), \\forall x'\\ni B_{\\varepsilon}(x)\\;X\\},  \\]   \\[  B_{\\varepsilon}(x)= \\{x'\\in {R_k}\\mid \\quad \\|x'- x\\|<\\varepsilon \\},  \\]  where \\(X^{\\text{opt}}\\), \\(X^{\\text{lopt}}\\) are the set of optimal solutions and the set of locally-optimal solutions of the stated global optimization problem, correspondingly. To be precise the problem consists in searching a point \\(x\\in X^{\\text{opt}}\\) where \\(X^{\\text{lopt}}\\neq X^{\\text{opt}}.\\) There are many methods of solving the stated problem and the continuation method is one of the important ones. Usually the continuation method is used for a wide class of minimization problems. As a result the efficiency of the proper algorithms is low. Contrary to this in the article a highly specialized class of global minimization problems is considered and the continuation algorithms are constructed that essentially use the specific features of the problem disscused.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1348544$DEE34DCB-1C67-439A-8F20-3E3350DC9518","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348544$7DBFBEA7-266D-426D-A161-7F51C1682392","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348544$C8200F43-F031-418B-A792-90F502C369C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"82a006ec5bbbadf5f063bfdc770a07a4120063ab","datavalue":{"value":"90C31","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348544$EDBDE3FA-A7A7-4BA1-A84D-C5A3AFA8DFD1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b72c75e4e27283895c46739fffb5f7f6c7ed4b30","datavalue":{"value":"1740009","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348544$C6B7D5E8-4FD0-4871-A008-8AEAE6B95ED0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c2df4be61b42c15be02a284667cc79d17284cd8","datavalue":{"value":"global optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1348544$DFFA026B-B4E9-42C5-B2DD-ABD837B0D043","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e7f664c7988b894a7e3de8c281176a8b5e7bb26","datavalue":{"value":"continuation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1348544$B03F8CB3-552E-4E41-BB2E-A4A18F7618F4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73027cba1a78d2b81c3e5b159f6527f176ebaf13","datavalue":{"value":"parametric programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1348544$2F4C2177-0809-44A7-A0A6-E47E1FCE2901","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"1339cd05034549bf98001b95bcc614fc651662c5","datavalue":{"value":{"entity-type":"item","numeric-id":586510,"id":"Q586510"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348544$95E1578A-317E-4112-91DD-203D1446D3C5","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":"Q1348544$763B6033-CCEE-479B-BC43-0A82186188E1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"706912e812f01947685915b473d0af6bc89cadb5","datavalue":{"value":{"entity-type":"item","numeric-id":4657619,"id":"Q4657619"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"baf1b8a190b63f993f271db1f32b19d9591aaacd","datavalue":{"value":{"amount":"+0.7819839119911194","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":"Q1348544$325AE925-7E2C-4D78-840C-D40F2F8A3552","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4de7b68e0341c487db4dab6ece31fb4745621d28","datavalue":{"value":{"entity-type":"item","numeric-id":880659,"id":"Q880659"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"99d827c3b68a2d5967de41254fdaed644b305b3a","datavalue":{"value":{"amount":"+0.780022144317627","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":"Q1348544$41D26E79-B1EE-482F-9E72-037F1BA324FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"932f2fab62e38701017acb0e883c0a44ddba7c59","datavalue":{"value":{"entity-type":"item","numeric-id":1102865,"id":"Q1102865"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3e67aad4f2f65d17cba795b0f0102436d833a3e3","datavalue":{"value":{"amount":"+0.7768730521202087","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":"Q1348544$F69EBA3C-D49D-4C29-9085-C2B4827EA91A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0839f923e9156d88cc8f78474409170375afd459","datavalue":{"value":{"entity-type":"item","numeric-id":1014042,"id":"Q1014042"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"74ffadcbe4d8dfc4e909d53d0df673dae4f6ddc9","datavalue":{"value":{"amount":"+0.7750154733657837","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":"Q1348544$E3C8FF57-6985-4370-A552-64120D072DD7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f7b64120600a668a43931aa26284b9a35d08c5b7","datavalue":{"value":{"entity-type":"item","numeric-id":1204955,"id":"Q1204955"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d5c77cf353dbb191fb8553dd574d7204f6efa291","datavalue":{"value":{"amount":"+0.7731112241744995","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":"Q1348544$1165AB86-A952-4804-96E6-103E7AE9802B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On an approach to construct continuation algorithms in global optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_an_approach_to_construct_continuation_algorithms_in_global_optimization"}}}}}