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ę "linear constraints" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1}
    Autorzy:
    Bolanowski, M.
    Paszkiewicz, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/106266.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
    Tematy:
    network synthesis
    linear Diophantine constraints
    TSS
    MTSS algorithm
    Opis:
    In the paper we present a method for synthesis of a set of connection networks, which fulfill the designer’s assumption. In order to do that, the designed network is presented as a system of Diophantine constraints in a special form. A method to resolve those systems is proposed, which is characterized by lower computational complexity, especially in the case of rare topologies design.
    Źródło:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2013, 13, 1; 11-21
    1732-1360
    2083-3628
    Pojawia się w:
    Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
    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ł:
    Deployment of a predictive-like optimal control law on a servo drive system using linear programming approach
    Autorzy:
    Horla, Dariusz
    Pinczewski, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/27309954.pdf
    Data publikacji:
    2023
    Wydawca:
    Polska Akademia Nauk. Czasopisma i Monografie PAN
    Tematy:
    constraints
    linear programming
    optimal control
    servo drive
    Opis:
    Current drive control systems tend to push control loops to the limits of their performance. One of the ways of doing so is to use advanced optimization algorithms, usually related to model-based off-line calculations, such as genetic algorithms, the particle swarmoptimisation or the others. There is, however, a simpler way, namely to use predictive control formalism and by formulation of a simple linear programming problem which is easy to solve using powerful solvers, without excessive computational burden, what is a reliable solution, as whenever the optimization problem has a feasible solution, a global minimizer can be efficiently found. This approach has been deployed for a servo drive system operated by a real-time sampled-data controller, verified between model-in-the-loop and hardwarein- the-loop configurations, for a range of prediction horizons, as an attractive alternative to classical quadratic programming-related formulation of predictive control task.
    Źródło:
    Archives of Electrical Engineering; 2023, 72, 4; 1005--1016
    1427-4221
    2300-2506
    Pojawia się w:
    Archives of Electrical Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Application of fuzzy programming techniques to solve solid transportation problem with additional constraints
    Autorzy:
    Halder (Jana), Sharmistha
    Jana, Biswapati
    Powiązania:
    https://bibliotekanauki.pl/articles/406403.pdf
    Data publikacji:
    2020
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    non-linear solid transportation problem
    impurity constraints
    fuzzy programming technique
    Opis:
    An innovative, real-life solid transportation problem is explained in a non-linear form. As in real life, the total transportation cost depends on the procurement process or type of the items and the distance of transportation. Besides, an impurity constraint is considered here. The proposed model is formed with fuzzy imprecise nature. Such an interesting model is optimised through two different fuzzy programming techniques and fractional programming methods, using LINGO-14.0 tools followed by the generalized gradient method. Finally, the model is discussed concerning these two different methods.
    Źródło:
    Operations Research and Decisions; 2020, 30, 1; 67-84
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Linear programming & metaheuristic approach for scheduling in the hybrid flowshop with resource constraints
    Autorzy:
    Figielska, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/206283.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    flowshop
    parallel machines
    resource constraints
    heuristics
    linear programming
    genetic algorithms
    simulated annealing
    tabu search
    Opis:
    This paper deals with the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources. The objective is the minimization of makespan. The problem is NP-hard. Heuristic algorithms are proposed which join the linear programming based procedures with metaheuristic algorithms: genetic, simulated annealing and tabu search algorithm. The performance of the proposed algorithms is experimentally evaluated by comparing the solutions with a lower bound on the optimal makespan. Results of a computational experiment show that these algorithms are able to produce good solutions in short computation time and that the metaheuristics significantly improve the results for the most difficult problems.
    Źródło:
    Control and Cybernetics; 2011, 40, 4; 1209-1230
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Error estimates for the finite-element approximation of an elliptic control problem with pointwise state and control constraints
    Autorzy:
    Meyer, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/971011.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    równanie eliptyczne
    aproksymacja numeryczna
    linear quadratic optimal control problems
    elliptic equations
    state constraints
    numerical approximation
    Opis:
    We consider a linear-quadratic elliptic optimal control problem with pointwise state constraints. The problem is fully discretized using linear ansatz functions for state and control. Based on a Slater-type argument, we investigate the approximation behavior for mesh size tending to zero. The obtained convergence order for the L²-error of the control and for H 1-error of the state is 1 - ε in the two-dimensional case and 1/2 - ε in three dimensions, provided that the domain satisfies certain regularity assumptions. In a second step, a state-constrained problem with additional control constraints is considered. Here, the control is discretized by constant ansatz functions. It is shown that the convergence theory can be adapted to this case yielding the same order of convergence. The theoretical findings are confirmed by numerical examples.
    Źródło:
    Control and Cybernetics; 2008, 37, 1; 51-83
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finite element error analysis for state-constrained optimal control of the Stokes equations
    Autorzy:
    Los Reyes, J. C. de
    Meyer, C.
    Vexler, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/969607.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    równanie Stokesa
    aproksymacja numeryczna
    element skończony
    linear quadratic optimal control problems
    Stokes equations
    state constraints
    numerical approximation
    finite elements
    Opis:
    An optimal control problem for 2d and 3d Stokes equations is investigated with pointwise inequality constraints on the state and the control. The paper is concerned with the full discretization of the control problem allowing for different types of discretization of both the control and the state. For instance, piecewise linear and continuous approximations of the control are included in the present theory. Under certain assumptions on the L∞-error of the finite element discretization of the state, error estimates for the control are derived which can be seen to be optimal since their order of convergence coincides with the one of the interpolation error. The assumptions of the L∞-finite-eleinent-error can be verified for different numerical settings. Finally the results of two numerical experiments are presented.
    Źródło:
    Control and Cybernetics; 2008, 37, 2; 251-284
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An active fault-tolerant control framework against actuator stuck failures under input saturations
    Autorzy:
    Qi, X.
    Theilliol, D.
    He, Y.
    Han, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/331084.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fault tolerant control
    actuator stuck failure
    actuator constraints
    reference redesign
    linear matrix inequality
    sterowanie tolerujące uszkodzenia
    projekt odniesienia
    liniowa nierówność macierzowa
    Opis:
    In this paper, a control framework including active fault-tolerant control (FTC) and reference redesign is developed subject to actuator stuck failures under input saturations. FTC synthesis and reference redesign approaches are proposed to guarantee post-fault system safety and reference reachability. Then, these features are analyzed under both actuator stuck failures and constraints before fault-tolerant controller switches. As the main contribution, actuator stuck failures and constraints are unified so that they can be easily considered simultaneously. By means of transforming stuck failures into actuator constraints, the post-fault system can be regarded as an equivalent system with only asymmetrical actuator constraints. Thus, methods against actuator saturations can be used to guarantee regional stability and produce the stability region. Based on this region, stuck compensation is analyzed. Specifically, an unstable open-loop system is considered, which is more challenging. Furthermore, the method is extended to a set-point tracking problem where the reachability of the original reference can be evaluated. Then, a new optimal reference will be computed for the post-fault system if the original one is unreachable. Finally, simulation examples are shown to illustrate the theoretical results.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 749-761
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    H-infinity control of discrete-time linear systems constrained in state by equality constraints
    Autorzy:
    Filasová, A.
    Krokavec, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/330125.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    układ dyskretny
    liniowa nierówność macierzowa
    sprzężenie zwrotne
    algorytm sterowania
    układ singularny
    equality constraints
    discrete time systems
    linear matrix inequality
    state feedback
    control algorithms
    quadratic stability
    singular systems
    Opis:
    In this paper, stabilizing problems in control design are addressed for linear discrete-time systems, reflecting equality constraints tying together some state variables. Based on an enhanced representation of the bounded real lemma for discrete-time systems, the existence of a state feedback control for such conditioned stabilization is proven, and an LMI-based design procedure is provided. The control law gain computation method used circumvents generally an ill-conditioned singular design task. The principle, when compared with previously published results, indicates that the proposed method outper forms the existing approaches, guarantees feasibility, and improves the steady-state accuracy of the control. Furthermore, better performance is achieved with essentially reduced design effort. The approach is illustrated on simulation examples, where the validity of the proposed method is demonstrated using one state equality constraint.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 551-560
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A stable homotopy approach to horizontal linear complementarity problems
    Autorzy:
    Ralph, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/206132.pdf
    Data publikacji:
    2002
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    ciągłość pseudo-Lipschitza
    metoda homotopii
    rozwiązanie stałe
    system kawałkami afiniczny
    active set method
    global metric regularity
    homotopy method
    horizontal linear complementarity problem
    mathematical program with complementarity constraints
    MPCC
    MPCC-LICQ
    MPEC
    path following
    piecewise affine system
    pseudo-Lipschitz continuity
    QPCC
    stable solution
    Opis:
    We are interested in the solution of Horizontal Linear Complementarity Problems, HLCPs, that is complementarity problems with more variables than equations. Globally metrically regular HLCPs have nonempty solution sets that are stable with respect to "right-hand-side perturbations" of the data, hence are numerically attractive. The main purpose of the paper is to show how the stability on conditioning properties of globally metrically regular HLCPs are preserved by a homotopy framework for solving the HLCP that finds a "stable" direcaion at each iteration as a local minimizer of a strongly convex quadratic program with linear complementarity constraints, QPCC. Apart from intrinsic interest in numerical solution of HLCPs, this investigation has application in solving horizontal nonlinear complementarity problems and more broadly in the area of mathematical programs with complementarity constraints, MPCCs.
    Źródło:
    Control and Cybernetics; 2002, 31, 3; 575-599
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      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