Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "globalna optymalizacja" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Modified blind naked mole-rat algorithm applied to electromagnetic design problems
    Autorzy:
    Taherdangkoo, Mohammad
    Powiązania:
    https://bibliotekanauki.pl/articles/1841273.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    electromagnetic design problems
    global optimization
    meta-heuristic algorithm
    problemy z projektowaniem elektromagnetycznym
    globalna optymalizacja
    algorytm metaheurystyczny
    Opis:
    In this paper,we proposed a modified meta-heuristic algorithm based on the blind naked mole-rat (BNMR) algorithm to solve the multiple standard benchmark problems. We then apply the proposed algorithm to solve an engineering inverse problem in the electromagnetic field to validate the results. The main objective is to modify the BNMR algorithm by employing two different types of distribution processes to improve the search strategy. Furthermore, we proposed an improvement scheme for the objective function and we have changed some parameters in the implementation of the BNMR algorithm. The performance of the BNMR algorithm was improved by introducing several new parameters to find the better target resources in the implementation of a modified BNMR algorithm. The results demonstrate that the changed candidate solutions fall into the neighborhood of the real solution. The results show the superiority of the propose method over other methods in solving various mathematical and electromagnetic problems.
    Źródło:
    Archives of Electrical Engineering; 2021, 70, 2; 167-380
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A neural-network controlled dynamic evolutionary scheme for global molecular geometry optimization
    Autorzy:
    Styrcz, A.
    Mrozek, J.
    Mazur, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/907520.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja globalna
    algorytm memetyczny
    geometria cząsteczki
    global optimization
    memetic algorithm
    molecular geometry
    Opis:
    A novel, neural network controlled, dynamic evolutionary algorithm is proposed for the purposes of molecular geometry optimization. The approach is tested for selected model molecules and some molecular systems of importance in biochemistry. The new algorithm is shown to compare favorably with the standard, statically parametrized memetic algorithm.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 3; 559-566
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Phenotypic evolution with a mutation based on symmetric alpha-stable distributions
    Autorzy:
    Obuchowicz, A.
    Prętki, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/907644.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm ewolucyjny
    dystrybucja stabilna
    optymalizacja globalna
    evolutionary algorithms
    Levy-stable distributions
    global optimization
    surrounding effect
    Opis:
    Multidimensional Symmetric alpha-Stable (S alpha S) mutations are applied to phenotypic evolutionary algorithms. Such mutations are characterized by non-spherical symmetry for alpha<2 and the fact that the most probable distance of mutated points is not in a close neighborhood of the origin, but at a certain distance from it. It is the so-called surrounding effect (Obuchowicz, 2001b; 2003b). For alpha=2, the S alpha S mutation reduces to the Gaussian one, and in the case of alpha=1, the Cauchy mutation is obtained. The exploration and exploitation abilities of evolutionary algorithms, using S alpha S mutations for different alpha, are analyzed by a set of simulation experiments. The obtained results prove the important influence of the surrounding effect of symmetric alpha-stable mutations on both the abilities considered.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 289-316
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
    Autorzy:
    El Mouatasim, A.
    Ellaia, R.
    Souza de Cursi, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/907785.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja globalna
    ograniczenie liniowe
    zaburzenie stochastyczne
    global optimization
    linear constraints
    variable metric method
    stochastic perturbation
    nonsmooth optimization
    Opis:
    We present a random perturbation of the projected variable metric method for solving linearly constrained nonsmooth (i.e., nondifferentiable) nonconvex optimization problems, and we establish the convergence to a global minimum for a locally Lipschitz continuous objective function which may be nondifferentiable on a countable set of points. Numerical results show the effectiveness of the proposed approach.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 317-329
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Fast edge detection approach based on global optimization convex model and Split Bregman algorithm
    Autorzy:
    Jing, Y.
    Liu, J.
    Liu, Z.
    Cao, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/329158.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
    Tematy:
    edge detection
    active contour
    global optimization
    numerical minimization
    split Bregman algorithm
    detekcja krawędzi
    kontur aktywny
    optymalizacja globalna
    algorytm Bregmana
    Opis:
    Active contour model is a typical and effective closed edge detection algorithm, which has been widely applied in remote sensing image processing. Since the variety of the image data source, the complexity of the application background and the limitations of edge detection, the robustness and universality of active contour model are greatly reduced in the practical application of edge extraction. This study presented a fast edge detection approach based on global optimization convex model and Split Bregman algorithm. Firstly, the proposed approach defined a generalized convex function variational model which incorporated the RSF model’s principle and Chan’s global optimization idea and could get the global optimal solution. Secondly, a fast numerical minimization scheme based on split Bregman iterative algorithm is employed for overcoming drawbacks of noise and others. Finally, the curve evolves to the target boundaries quickly and accurately. The approach was applied in real special sea ice SAR images and synthetic images with noise, fuzzy boundaries and intensity inhomogeneity, and the experiment results showed that the proposed approach had a better performance than the edge detection methods based on the GMAC model and RSF model. The validity and robustness of the proposed approach were also verified.
    Źródło:
    Diagnostyka; 2018, 19, 2; 23-29
    1641-6414
    2449-5220
    Pojawia się w:
    Diagnostyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The island model as a Markov dynamic system
    Autorzy:
    Schaefer, R.
    Byrski, A.
    Smołka, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/331253.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm genetyczny
    analiza asymptotyczna
    optymalizacja globalna
    algorytm ewolucyjny równoległy
    łańcuch Markova
    genetic algorithms
    asymptotic analysis
    global optimization
    parallel evolutionary algorithms
    Markov chain modeling
    Opis:
    Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators. An original and crucial feature of the framework we propose is the mechanism of inter-deme agent operation synchronization. It is important from both a practical and a theoretical point of view. We show that under a mild assumption the resulting Markov chain is ergodic and the sequence of the related sampling measures converges to some invariant measure. The asymptotic guarantee of success is also obtained as a simple issue of ergodicity. Moreover, if the cardinality of each island population grows to infinity, then the sequence of the limit invariant measures contains a weakly convergent subsequence. The formal description of the island model obtained for the case of solving a single-objective problem can also be extended to the multi-objective case.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 971-984
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modelling and identification of voids nucleation and growth effects in porous media plastic flow
    Autorzy:
    Nowak, Z.
    Stachurski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/970581.pdf
    Data publikacji:
    2003
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja globalna
    regresja nieliniowa
    programowanie nieliniowe
    plastic flow of voided media
    material functions identification
    global optimization
    nonlinear regression
    nonlinear programming
    Akaike and FPE tests for nested models
    Vuong test for nonnested models
    Opis:
    In the paper the effects of nucleation and growth of voids in the plastic porous media are investigated. Three different forms of the model are considered: the augmented Gurson model (total porosity model) with variable nucleation and growth material function, the same model with constant growth material function and the separated porosity model. The identification of the material functions parameters is based on Fischer's experimental data set for axisymmetric tension of steel specimens and formulated as a typical nonlinear regression problem using the least squares approach. The resulting minimization problem is solved by means of our own implementation of the Boender at al. global minimization method. Calculations and statistical analysis (Akaike, FPE and Vuong tests) have led to a conclusion that the growth material function in the uniaxial tension for steel may be assumed to be constant although not necessarily equal to one.
    Źródło:
    Control and Cybernetics; 2003, 32, 4; 819-849
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies