{"entities":{"Q1101007":{"pageid":1111759,"ns":120,"title":"Item:Q1101007","lastrevid":66721536,"modified":"2026-04-12T12:24:02Z","type":"item","id":"Q1101007","labels":{"en":{"language":"en","value":"Recursion algorithms for search optimization in relative noise. I: Maximal possibilities"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4045468"}},"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":"Q1101007$EAA45D26-3377-4027-B91D-A39B6DFA7651","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5ccdbb4c5d33f04ac1f8817002cc3322d421428c","datavalue":{"value":{"text":"Recursion algorithms for search optimization in relative noise. I: Maximal possibilities","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1101007$9A0E5875-A1CE-4FB2-8424-28EE8283ECEF","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"db53906f3412d3f8191fcc6d87666a873192098f","datavalue":{"value":"0641.90045","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101007$E01E086E-DE0C-474D-964E-45738CD50E16","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e3c9e722be426d69a3886c34af6fc648e1ad9b71","datavalue":{"value":{"entity-type":"item","numeric-id":1101006,"id":"Q1101006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101007$84CF0385-0513-4DEF-B75F-E0743C7BE2B6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"aad9276e3957ac602ea35cd62a712ff2751ef7d3","datavalue":{"value":{"entity-type":"item","numeric-id":345913,"id":"Q345913"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101007$2BC4A3AB-3A22-4E30-BFC5-59FB297482DA","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1101007$9F475995-1CE0-4D22-B976-C92E24830F62","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1101007$EFC2C37F-FAD5-48B8-871A-306CA878BF5A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"d230030d81d6f59c2a22b87f1768fc21f43b9dfd","datavalue":{"value":"We examine the problems of search optimization in noise whose intensity is functionally connected with the deviation from an unknown extremum. The maximal possibilities of stochastic recursion optimization algorithms relative to these problems are studied. We will analyze variants of these problems for which the order of the maximal possible asymptotic convergence can be evaluated explicitly for these algorithms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101007$10A10AFC-927A-4001-9EFF-5D73B6114C28","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30d6d0de101c6ff200d712a6d7e331bcba20c783","datavalue":{"value":"90B40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101007$DC65D608-4B68-4DB0-8603-85064DF6872B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c16d8892388cfccc84e791f7e83b267972477d23","datavalue":{"value":"4045468","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1101007$82D415EF-5009-4C36-87C0-3957AF695604","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d65886b24da08059a17e55b9e29cc397e1b90014","datavalue":{"value":"search optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101007$2645282F-7926-4A56-B35D-C688313A4DDA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4420691c382685c1305b08f3beffeadd31541e15","datavalue":{"value":"stochastic recursion optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101007$9888062E-449A-4912-A075-02FB89F0F99E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"965b2714a8f9b89c6ffb35cef79f6d2065e7c7b2","datavalue":{"value":"maximal possible asymptotic convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q1101007$3A4D6628-FFB1-45A4-874B-B1F45EE8F9CE","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":"Q1101007$A5CE8CB9-12CF-4BE9-8504-8E2743621285","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"008f2967194766baaa669207241ea4a1df9436e2","datavalue":{"value":{"entity-type":"item","numeric-id":1107447,"id":"Q1107447"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8a63fd77704448d35ead2379cd8b2b5fad9e6b21","datavalue":{"value":{"amount":"+0.8909177780151367","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":"Q1101007$43504EC0-5A68-4685-BD23-84D34F0F5091","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c7a2d971ed361c8242560e42fd08f566753a6902","datavalue":{"value":{"entity-type":"item","numeric-id":3701216,"id":"Q3701216"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e483bf9672ccdcd170974c3bfb25cb203f4147bb","datavalue":{"value":{"amount":"+0.7882837653160095","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":"Q1101007$0E4D916F-A4F6-4364-A556-77E7E8024CE6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"764b10fb5d383df87699e2d2798a62a3924eb378","datavalue":{"value":{"entity-type":"item","numeric-id":3325609,"id":"Q3325609"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a8ca55c36d14ab42b93761ae197d637554db4225","datavalue":{"value":{"amount":"+0.7665196657180786","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":"Q1101007$1E42F497-8D5B-40F3-B717-949B985DE2F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bd226283b12eccde2a394191e0f77de9b8877c05","datavalue":{"value":{"entity-type":"item","numeric-id":4528266,"id":"Q4528266"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3e3c42f97d5dc77131038e5e86ea5176a85789db","datavalue":{"value":{"amount":"+0.7610180974006653","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":"Q1101007$B63894F1-DEC2-4B9E-AF4B-A3CC94923731","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4d494af6f5d2d3175efd91fdfba0e8615faf912b","datavalue":{"value":{"entity-type":"item","numeric-id":749450,"id":"Q749450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"04dc54260e4ad7b4bf32cc47b5c965c30860082c","datavalue":{"value":{"amount":"+0.7598246932029724","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":"Q1101007$06117604-CA0B-42FA-96E9-F98A7077659B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Recursion algorithms for search optimization in relative noise. I: Maximal possibilities","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Recursion_algorithms_for_search_optimization_in_relative_noise._I:_Maximal_possibilities"}}}}}