Informacja

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

Wyszukujesz frazę "SQP" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Optimization of hydraulic crane prototype
Optymalizacja prototypu żurawia hydraulicznego
Autorzy:
Mysłek, A.
Sanecki, H.
Powiązania:
https://bibliotekanauki.pl/articles/404302.pdf
Data publikacji:
2017
Wydawca:
Polskie Towarzystwo Symulacji Komputerowej
Tematy:
hydraulic crane
CAD
finite element method
FEM
structural optimization
GDP and SQP algorithms
żuraw hydrauliczny
metoda elementów skończonych
MES
optymalizacja strukturalna
algorytmy GDP i SQP
Opis:
The paper presents an application of research methodology leading to structural optimization of a crane model containing hydraulic cylinders. CAD and CAE systems were used to obtain a three-dimensional model of the crane and state of stresses and displacements, as well as to carry out appropriate optimization procedures. This issue is important from the point of view of full strength verification of modern transport equipment, particularly at the design stage, while detailed experimental research is not yet conducted.
Praca prezentuje metodykę badań prowadzącą do optymalizacji strukturalnej żurawia zawierającego siłowniki hydrauliczne. Zastosowano systemy CAD i CAE do uzyskania trójwymiarowego modelu żurawia oraz stanu naprężeń i przemieszczeń, a także do przeprowadzenia odpowiednich operacji optymalizacyjnych. Zagadnienie jest istotne z punktu widzenia pełnej weryfikacji wytrzymałościowej nowoczesnych urządzeń transportu bliskiego zwłaszcza na etapie projektowania, gdy jeszcze nie prowadzi się szczegółowych badań doświadczalnych.
Źródło:
Symulacja w Badaniach i Rozwoju; 2017, 8, 3-4; 105-113
2081-6154
Pojawia się w:
Symulacja w Badaniach i Rozwoju
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized Newton and NCP-methods: convergence, regularity, actions
Autorzy:
Kummer, Bernd
Powiązania:
https://bibliotekanauki.pl/articles/729371.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
nonsmooth functions
generalized Newton methods
critical points
complementarity
SQP methods
inverse mappings
regularity
Opis:
Solutions of several problems can be modelled as solutions of nonsmooth equations. Then, Newton-type methods for solving such equations induce particular iteration steps (actions) and regularity requirements in the original problems. We study these actions and requirements for nonlinear complementarity problems (NCP's) and Karush-Kuhn-Tucker systems (KKT) of optimization models. We demonstrate their dependence on the applied Newton techniques and the corresponding reformulations. In this way, connections to SQP-methods, to penalty-barrier methods and to general properties of so-called NCP-functions are shown. Moreover, direct comparisons of the hypotheses and actions in terms of the original problems become possible. Besides, we point out the possibilities and bounds of such methods in dependence of smoothness.
Źródło:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 209-244
1509-9407
Pojawia się w:
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm
Autorzy:
Li, S. Y.
Hu, C. F.
Teng, C. J.
Powiązania:
https://bibliotekanauki.pl/articles/970454.pdf
Data publikacji:
2004
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
rozmyte programowanie celowe
priorytet
algorytm genetyczny
fuzzy goal programming
priorities
SQP
genetic algorithm
GENOCOP III
Opis:
This paper proposes a generalized domain optimization method for fuzzy goal programming with different priorities. According to the three possible styles of the objective function, the domain optimization method and its generalization are correspondingly proposed. This method can generate the results consistent with the decision-maker's priority expectations, according to which the goal with higher priority may have higher level of satisfaction. However, the reformulated optimization problem may be nonconvex for the reason of the nature of the original problem and the introduction of the varying-domain optimization method. It is possible to obtain a local optimal solution for nonconvex programming by the SQP algorithm. In order to get the global solution of the new programming problem, the co-evolutionary genetic algorithm, called GENOCOP III, is used instead of the SQP method. In this way the decision-maker can get. the optimum of the optimization problem. We demonstrate the power of this proposed method based on genetic algorithm by illustrative examples.
Źródło:
Control and Cybernetics; 2004, 33, 4; 633-652
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimisation of operating conditions in fed-batch baker’s yeast fermentation
Autorzy:
Atasoy, I.
Yuceer, M.
Berber, R.
Powiązania:
https://bibliotekanauki.pl/articles/185738.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fed-batch fermenter
baker's yeast
dynamic optimization
SQP
Nonlinear
fermentator półciągły
drożdże piekarskie
optymalizacja dynamiczna
nieliniowość
Opis:
Saccharamyces cerevisia known as baker’s yeast is a product used in various food industries. Worldwide economic competition makes it a necessity that industrial processes be operated in optimum conditions, thus maximisation of biomass in production of saccharamyces cerevisia in fedbatch reactors has gained importance. The facts that the dynamic fermentation model must be considered as a constraint in the optimisation problem, and dynamics involved are complicated, make optimisation of fed-batch processes more difficult. In this work, the amount of biomass in the production of baker’s yeast in fed-batch fermenters was intended to be maximised while minimising unwanted alcohol formation, by regulating substrate and air feed rates. This multiobjective problem has been tackled earlier only from the point of view of finding optimum substrate rate, but no account of air feed rate profiles has been provided. Control vector parameterisation approach was applied the original dynamic optimisation problem which was converted into a NLP problem. Then SQP was used for solving the dynamic optimisation problem. The results demonstrate that optimum substrate and air feeding profiles can be obtained by the proposed optimisation algorithm to achieve the two conflicting goals of maximising biomass and minimising alcohol formation.
Źródło:
Chemical and Process Engineering; 2013, 34, 1; 175-186
0208-6425
2300-1925
Pojawia się w:
Chemical and Process Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Effect of liquid scintillating cocktail volume on 3H and 14C measurement parameters using a Quantulus spectrometer
Autorzy:
Komosa, A.
Ślepecka, K.
Powiązania:
https://bibliotekanauki.pl/articles/148489.pdf
Data publikacji:
2010
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
liquid scintillating cocktail
tritium
14C
Quantulus
counting efficiency
standard quench parameter (SQP)
figure of merit (FOM)
Opis:
Results of study on the influence of cocktail volume on such measuring parameters as counting efficiency, standard quench parameter (SQP) and figure of merit (FOM) are described. Nine commercial cocktails were tested using a Quantulus spectrometer. Two kinds of vials (low-diffusion teflon-coated polyethylene (LD-PE) and high-performance glass (HP-G)) and two standard solutions (14C and 3H) were used. Measurements were performed at seven quench levels ensured by carbon tetrachloride addition to the scintillation vials. Various quench sensitivity of the studied cocktails was found. Cocktails based on simple benzene-derived solvents revealed the best quench resistance. In general, increasing cocktail volume caused an increase in the counting efficiency. However, the background increased as well, what resulted in FOM diminishing. Studied cocktails revealed also various responses to volume changes.
Źródło:
Nukleonika; 2010, 55, 2; 155-161
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the Lagrange-SQP-Newton method for the control of a phase field equation
Autorzy:
Heinkenschloss, M.
Troeltzsch, F.
Powiązania:
https://bibliotekanauki.pl/articles/206519.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
równania paraboliczne
równania różniczkowe
stabilność
sterowanie optymalne
control constraints
Lagrange-SQP-Newton method
optimal control
phase field equation
programming method
sequential quadratic
Opis:
This paper investigates the local convergence of the Lagrange-SQP-Newton method applied to an optimal control problem governed by a phase field equation with distributed control. The phase field equation is a system of two semilinear parabolic differential equations. Stability analysis of optimization problems and regularity results for parabolic differential equations are used to proof convergence of the controls with respect to the L[sup 2](Q) norm and with respect to the L[sup infinity](Q) norm.
Źródło:
Control and Cybernetics; 1999, 28, 2; 177-211
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
Autorzy:
Valčić, M.
Prpić-Oršić, J.
Powiązania:
https://bibliotekanauki.pl/articles/116991.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithm
dynamic positioning
direct search algorithms
sequential quadratic programing (SQP)
Singular Values Decomposition (SVD)
Lagrangian Multiplier Method (LMM)
Direct Search (DS)
Mesh Adaptive Direct Search (MADS)
Opis:
In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
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