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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    Solving Markov decision processes by d-graph algorithms
    Autorzy:
    Kátai, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/205688.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Markov decision processes
    dynamic programming
    graph representation
    graph algorithms
    optimization problems
    Opis:
    Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
    Źródło:
    Control and Cybernetics; 2012, 41, 3; 577-593
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exponential and chaotic neurodynamical tabu searches for quadratic assignment problems
    Autorzy:
    Hasegawa, M.
    Ikeguchi, T.
    Aihara, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206864.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    problem optymalizacji kombinatorycznej
    sieć neuronowa
    chaos
    combinatorial optimization problems
    neural networks
    quadratic assignment problems
    tabu search
    Opis:
    We propose a chaotic neurodynamical searching method for the Quadratic Assignment Problems (QAPs). First, we construct a neural network whose behavior is the same as that of the conventional tabu search. Using the dynamics of the tabu search neural network, we realize the exponential tabu search, whose tabu effect decreases exponentially with time, and we show the effectiveness of this type of exponential tabu search. Next, we extend this novel tabu search to a chaotic version. This chaotic method includes both effects of the chaotic dynamical search and the exponential tabu search, and exhibits better performance than the conventional and exponential tabu searches. Last, we propose an automatic parameter tuning method and show that the proposed method exhibits high performance even on large QAPs.
    Źródło:
    Control and Cybernetics; 2000, 29, 3; 773-788
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sensitivity analysis for state constrained optimal control problems
    Autorzy:
    Malanowski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206110.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sensitivity analysis
    cone-constrained optimization problems
    nonlinear optimal control
    first order state constraints
    Opis:
    A sensitivity result for cone-constrained optimization problem in abstract Hilbert spaces is obtained, using a slight modification of Haraux's theorem on differentiability of the metric projection onto polyhedric sets. This result is applied to sensitivity analysis for nonlinear optimal control problems subject to first order state constraints.
    Źródło:
    Control and Cybernetics; 2011, 40, 4; 1043-1058
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimal design of stationary flow problems by path-following interior-point methods
    Autorzy:
    Antil, H.
    Hoppe, R. H.
    Linsenmann, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/970290.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    shape optimization
    Stokes flow problems
    path-following interior-point methods
    Opis:
    We consider the numerical solution of structural optimization problems in CFD where the state variables are supposed to satisfy a linear or nonlinear Stokes system and the design variables are subject to bilateral pointwise constraints. Within a primal-dual setting, we suggest an all-at-once approach based on interior-point methods. The discretization is taken care of by Taylor-Hood elements with respect to a simplicial triangulation of the computational domain. The efficient numerical solution of the discretized problem relies on path-following techniques, namely a continuation method with an adaptive choice of the continuation step size, a long-step path-following algorithm and a nonlinear version of Mehrotra's algorithm. The performance of the suggested methods is documented by several illustrative numerical examples.
    Źródło:
    Control and Cybernetics; 2008, 37, 4; 771-796
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Topological derivative for optimal control problems
    Autorzy:
    Sokołowski, J.
    Żochowski, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/206790.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sterowanie optymalne
    asymptotic expansion
    control problems
    shape derivative
    shape optimization
    topological derivative
    Opis:
    The topological derivative is introduced for the extremal values of cost functionals for control problems. The optimal control problem considered in the paper is defined for the elliptic equation which models the deflection of an elastic membrane. The derivative measures the sensitivity of the optimal value of the cost with respect to changes in topology. A change in topology means removing a small ball from the interior of the domain of integration. The topological derivative can be used for obtaining the numerical solutions of the shape optimization problems.
    Źródło:
    Control and Cybernetics; 1999, 28, 3; 611-625
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the robustness of the topological derivative for Helmholtz problems and applications
    Autorzy:
    Leugering, Günter
    Novotny, Antonio André
    Sokolowski, Jan
    Powiązania:
    https://bibliotekanauki.pl/articles/2183490.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    topological derivative
    shape optimization
    inverse problems
    Helmholtz problem
    numerical methods
    complex variables
    Opis:
    We consider Helmholtz problems in two and three dimensions. The topological sensitivity of a given cost function J(uɛ) with respect to a small hole Bɛ around a given point x0ɛ ∈ Bɛ ⊂ Ω depends on various parameters, like the frequency k chosen or certain material parameters or even the shape parameters of the hole Bɛ. These parameters are either deliberately chosen in a certain range, as, e.g., the frequencies, or are known only up to some bounds. The problem arises as to whether one can obtain a uniform design using the topological gradient. We show that for 2-d and 3-d Helmholtz problems such a robust design is achievable.
    Źródło:
    Control and Cybernetics; 2022, 51, 2; 227--248
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sub-gradient algorithms for computation of extreme eigenvalues of a real symmetric matrix
    Autorzy:
    Yassine, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/205834.pdf
    Data publikacji:
    1998
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    problem wartości własnej
    difference of convex functions
    eigenvalue problems
    Lagrangian duality
    non-convex optimization
    sub-gradient algorithms
    Opis:
    The computation of eigenvalues of a matrix is still of importance from both theoretical and practical points of view. This is a significant problem for numerous industrial and scientific situations, notably in dynamics of structures (e.g. Gerardin, 1984), physics (e.g. Rappaz, 1979), chemistry (e.g. Davidson, 1983), economy (e.g. Morishima, 1971; Neumann, 1946), mathematics (e.g. Golub, 1989; Chatelin, 1983, 1984, 1988). The study of eigenvalue problems remains a delicate task, which generally presents numerical difficulties in relation to its sensivity to roundoff errors that may lead to numerical unstabilities, particularly if the eigenvalues are not well separated. In this paper, new subgradient-algorithms for computation of extreme eigenvalues of a symmetric real matrix are presented. Those algorithms are based on stability of Lagrangian duality for non-convex optimization and on duality in the difference of convex functions. Some experimental results which prove the robustness and efficiency of our algorithms are provided.
    Źródło:
    Control and Cybernetics; 1998, 27, 3; 387-415
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On some new phenomena in state-constrained optimal control if ODEs as well as PDEs are involved
    Autorzy:
    Pesch, H. J.
    Rund, A.
    Wahl, V.
    Wendl, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/969885.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optimal control of partial differential equations
    ODE-PDE-constrained optimization
    state constraints
    non-local state-constraints
    integro-state constraints
    optimal control problems for integro-differential equations
    jump conditions
    Opis:
    In this paper we investigate a new class of optimal control problems with ODE as well as PDE constraints. We would like to call them "hypersonic rocket car problems", since they were inspired, on the one hand, by the well known rocket car problem from the early days of ODE optimal control, on the other hand by a recently investigated flight path trajectory optimization problem for a hypersonic aircraft. The hypersonic rocket car problems mimic the latter's coupling structure, yet in a strongly simplified form. They can therefore be seen as prototypes of ODE-PDE control problems. Due to their relative simplicity they allow to a certain degree to obtain analytical solutions and insights into the structure of the adjoints, which would currently be unthinkable with complex real life problems. Our main aim is to derive and verify the necessary optimality conditions. Most of the obtained results bear a lot of similarities with state constrained ODE optimal control problems, yet we also observed some new phenomena.
    Źródło:
    Control and Cybernetics; 2010, 39, 3; 647-660
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Time-parametric control : uniform convergence of the optimal value functions of discretized problems
    Autorzy:
    Gugat, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206773.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    ciąg
    dyskretyzacja
    funkcja celu
    optymalizacja parametryczna
    profil momentu
    systemy sterowania minimalno-czasowe
    warunek Hoeldera
    warunek Lipschitza
    zbieżność jednakowa
    continuity
    discretization
    Hoelder condition
    Lipschitz condition
    moment problems
    optimal value function
    parametric optimization
    time-minimal control
    uniform convergence
    Opis:
    The problem of time-optimal control of linear hyperbolic systems is equivalent to the computation of the root of the optimal value function of a time-parametric program, whose feasible set is described by a countable system of moment equations. To compute this root, discretized problems with a finite number of equality constraints can be used. In this paper, we show that on a certain time-interval, the optimal value functions of the discretized problems converge uniformly to the optimal value function of the original problem. We also give sufficient conditions fot Lipschitz and Hoelder continuity of the optimal value function of the original problem.
    Źródło:
    Control and Cybernetics; 1999, 28, 1; 7-33
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      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