An entropic approach to the optimum search for the optimum of a unimodal function (Q581243): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Elementary properties of the discrete entropy from information theory show how to select the shortest strategy to perform a series of auxiliary experiments in order to eliminate, step by step, the existing uncertainty on the possible outcomes of a main experiment. Let us take the following main experiment: locate a subinterval of length 2E of the initial interval [a,b] where a unimodal function f attains its optimum. The auxiliary experiments are defined in two ways: Case 1: At each step compare a pair of observations corresponding to two inner points of the current interval, and select adequately a subinterval where the unique optimum is located. Case 2: At each step compare a triad of observations corresponding to three inner points of the current interval, and select adequately a subinterval where the optimum is located. The entropic approach shows, in a simple way, that the optimum search is obtained when the search points are consecutive Fibonacci numbers in case 1 and when the search points are equidistant in case 2. | |||
Property / review text: Elementary properties of the discrete entropy from information theory show how to select the shortest strategy to perform a series of auxiliary experiments in order to eliminate, step by step, the existing uncertainty on the possible outcomes of a main experiment. Let us take the following main experiment: locate a subinterval of length 2E of the initial interval [a,b] where a unimodal function f attains its optimum. The auxiliary experiments are defined in two ways: Case 1: At each step compare a pair of observations corresponding to two inner points of the current interval, and select adequately a subinterval where the unique optimum is located. Case 2: At each step compare a triad of observations corresponding to three inner points of the current interval, and select adequately a subinterval where the optimum is located. The entropic approach shows, in a simple way, that the optimum search is obtained when the search points are consecutive Fibonacci numbers in case 1 and when the search points are equidistant in case 2. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4018785 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
entropic approach | |||
Property / zbMATH Keywords: entropic approach / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
optimum search | |||
Property / zbMATH Keywords: optimum search / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unimodal function | |||
Property / zbMATH Keywords: unimodal function / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
consecutive Fibonacci numbers | |||
Property / zbMATH Keywords: consecutive Fibonacci numbers / rank | |||
Normal rank |
Revision as of 18:51, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An entropic approach to the optimum search for the optimum of a unimodal function |
scientific article |
Statements
An entropic approach to the optimum search for the optimum of a unimodal function (English)
0 references
1987
0 references
Elementary properties of the discrete entropy from information theory show how to select the shortest strategy to perform a series of auxiliary experiments in order to eliminate, step by step, the existing uncertainty on the possible outcomes of a main experiment. Let us take the following main experiment: locate a subinterval of length 2E of the initial interval [a,b] where a unimodal function f attains its optimum. The auxiliary experiments are defined in two ways: Case 1: At each step compare a pair of observations corresponding to two inner points of the current interval, and select adequately a subinterval where the unique optimum is located. Case 2: At each step compare a triad of observations corresponding to three inner points of the current interval, and select adequately a subinterval where the optimum is located. The entropic approach shows, in a simple way, that the optimum search is obtained when the search points are consecutive Fibonacci numbers in case 1 and when the search points are equidistant in case 2.
0 references
entropic approach
0 references
optimum search
0 references
unimodal function
0 references
consecutive Fibonacci numbers
0 references