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ę "constrained optimization" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Unilateral Contact Applications Using Fem Software
    Autorzy:
    Stavroulaki, M. E.
    Stavroulakis, G. E.
    Powiązania:
    https://bibliotekanauki.pl/articles/907898.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    matematyka
    nonsmooth analysis
    constrained optimization
    contact problem
    Opis:
    Nonsmooth analysis, inequality constrained optimization and variational inequalities are involved in the modelling of unilateral contact problems. The corresponding theoretical and algorithmic tools, which are part of the area known as nonsmooth mechanics, are by no means classical. In general purpose software some of these tools (perhaps in a simplified way) are currently available. Two engineering applications, a rubber-coated roller contact problem and a masonry wall, solved with MARC, are briefly presented, together with elements of the underlying theory.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2002, 12, 1; 115-125
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Derivative-free nonlinear optimization filter simplex
    Autorzy:
    Correia, A.
    Matias, J.
    Mestre, P.
    Serodio, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/908145.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja nieliniowa
    optymalizacja ograniczona
    metoda filtru
    nonlinear constrained optimization
    filter methods
    direct search methods
    Opis:
    The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence is not necessary: direct search methods or derivative-free methods are examples of such techniques. In this work we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of simplex and filter methods. This method neither computes nor approximates derivatives, penalty constants or Lagrange multipliers.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 4; 679-688
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Robust extremum seeking for a second order uncertain plant using a sliding mode controller
    Autorzy:
    Solis, Cesar
    Clempner, Julio
    Poznyak, Alexander
    Powiązania:
    https://bibliotekanauki.pl/articles/330477.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    convex optimization
    extremum seeking
    continuous time gradient algorithm
    dynamical constrained optimization
    unknown function
    optymalizacja wypukła
    poszukiwanie ekstremum
    algorytm gradientowy
    optymalizacja ograniczona
    Opis:
    This paper suggests a novel continuous-time robust extremum seeking algorithm for an unknown convex function constrained by a dynamical plant with uncertainties. The main idea of the proposed method is to develop a robust closed-loop controller based on sliding modes where the sliding surface takes the trajectory around a zone of the optimal point. We assume that the output of the plant is given by the states and a measure of the function. We show the stability and zone-convergence of the proposed algorithm. In order to validate the proposed method, we present a numerical example.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 703-712
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Local stability conditions for discrete-time cascade locally recurrent neural networks
    Autorzy:
    Patan, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/907772.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć lokalnie rekurencyjna
    stabilność
    stabilizacja
    uczenie się
    optymalizacja ograniczona
    locally recurrent neural network
    stability
    stabilization
    learning
    constrained optimization
    Opis:
    The paper deals with a specific kind of discrete-time recurrent neural network designed with dynamic neuron models. Dynamics are reproduced within each single neuron, hence the network considered is a locally recurrent globally feedforward. A crucial problem with neural networks of the dynamic type is stability as well as stabilization in learning problems. The paper formulates local stability conditions for the analysed class of neural networks using Lyapunov's first method. Moreover, a stabilization problem is defined and solved as a constrained optimization task. In order to tackle this problem, a gradient projection method is adopted. The efficiency and usefulness of the proposed approach are justified by using a number of experiments.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 23-34
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An automatic collision avoidance algorithm for multiple marine surface vehicles
    Autorzy:
    Hedjar, Ramdane
    Bounkhel, Messaoud
    Powiązania:
    https://bibliotekanauki.pl/articles/329948.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    unmanned surface vehicle
    obstacle avoidance
    control allocation
    constrained convex optimization
    bezzałogowy pojazd nawodny
    omijanie przeszkody
    układ alokacji
    optymalizacja wypukła
    Opis:
    In recent years, unmanned surface vehicles have been widely used in various applications from military to civil domains. Seaports are crowded and ship accidents have increased. Thus, collision accidents occur frequently mainly due to human errors even though international regulations for preventing collisions at seas (COLREGs) have been established. In this paper, we propose a real-time obstacle avoidance algorithm for multiple autonomous surface vehicles based on constrained convex optimization. The proposed method is simple and fast in its implementation, and the solution converges to the optimal decision. The algorithm is combined with the PD-feedback linearization controller to track the generated path and to reach the target safely. Forces and azimuth angles are efficiently distributed using a control allocation technique. To show the effectiveness of the proposed collision-free path-planning algorithm, numerical simulations are performed.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 759-768
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Supervisory predictive control and on-line set-point optimization
    Autorzy:
    Tatjewski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/929583.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sterowanie predykcyjne
    sterowanie nieliniowe
    linearyzacja
    model niepewności
    sterowność wymuszona
    optymalizacja
    predictive control
    nonlinear control
    linearisation
    model uncertainty
    constrained control
    set-point optimization
    Opis:
    The subject of this paper is to discuss selected effective known and novel structures for advanced process control and optimization. The role and techniques of model-based predictive control (MPC) in a supervisory (advanced) control layer are first shortly discussed. The emphasis is put on algorithm efficiency for nonlinear processes and on treating uncertainty in process models, with two solutions presented: the structure of nonlinear prediction and successive linearizations for nonlinear control, and a novel algorithm based on fast model selection to cope with process uncertainty. Issues of cooperation between MPC algorithms and on-line steady-state set-point optimization are next discussed, including integrated approaches. Finally, a recently developed two-purpose supervisory predictive set-point optimizer is discussed, designed to perform simultaneously two goals: economic optimization and constraints handling for the underlying unconstrained direct controllers.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 3; 483-495
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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