Autor: Zilinskas, A. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Hybrid search for optimum in a small implicitly defined region
Autorzy:: Zilinskas, A.
Powiązania:: https://bibliotekanauki.pl/articles/970451.pdf
Data publikacji:: 2004
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: wyszukiwanie losowe
optymalizacja ewolucyjna
więzy niejawne
projekt optymalny
random search
evolutionary optimization
implicit constrains
optimal design
Opis:: We consider optimization problems with a small implicitly denned feasible region, and with an objective function corrupted by irregularities, e.g. small noise added to the function values. Known mathematical programming methods with high convergence rate can not, lie applied to such problems. A hybrid technique is developed combining random search for the feasible region of a considered problem, and evolutionary search for the minimum over the found region. The solution results of two test problems and of a difficult real world problem are presented.
Źródło:: Control and Cybernetics; 2004, 33, 4; 599-609
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On probabilistic bounds inspired by interval arithmetic
Autorzy:: Zilinskas, A.
Zilinskas, J.
Powiązania:: https://bibliotekanauki.pl/articles/969846.pdf
Data publikacji:: 2010
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: global optimization
branch and bound method
randomized computing
interval arithmetic
Opis:: A randomized method aimed at evaluation of probabilistic bounds for function values is considered. Stochastic intervals tightly covering ranges of function values with probability close to one are modelled by a randomized method inspired by interval arithmetic. Statistical properties of the modelled intervals are investigated experimentally. The experimental results are discussed with respect to application of this method in the construction of a branch and bound type randomized algorithm for global optimization.
Źródło:: Control and Cybernetics; 2010, 39, 2; 507-525
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On the choice of statistical model for one-dimensional P-algorithms
Autorzy:: Calvin, J.
Zilinskas, A.
Powiązania:: https://bibliotekanauki.pl/articles/205977.pdf
Data publikacji:: 2000
Wydawca:: Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:: analiza statystyczna
model statystyczny
optymalizacja
prawdopodobieństwo
algorithm
asymptotic properties
convergence
optimization
probability
statistical analysis
statistical models
Opis:: Algorithms based on statistical models compete favorably with other global optimization algorithms as proved by extensive testing results. Recently, techniques were developed for theoretically estimating the rate of convergence of global optimization algorithms with respect to the underlying statistical models. In the present paper these technictues are extended for theoretical investigation of P-algorithms without respect to a statistical model. Theoretical estimates may eliminate the need for lengthy experimental investigation which previously was the only method for comparison of the algorithms. The rcaults obtained give new insight into the role of the mnderlying statistical model with respect to the asymptotic properties of the algorithm which will be useful for the implementation of new versions of the algoritlmns.
Źródło:: Control and Cybernetics; 2000, 29, 2; 555-565
0324-8569
Pojawia się w:: Control and Cybernetics
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja