Temat: quadratic programming method - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Optimal boundary control problems of retarded parabolic systems
Autorzy:: Kowalewski, A.
Krakowiak, A.
Powiązania:: https://bibliotekanauki.pl/articles/229191.pdf
Data publikacji:: 2013
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: boundary control
parabolic systems
time delays
linear quadratic problem
quadratic programming method
Opis:: Optimal boundary control problems of retarded parabolic systems are presented. Necessary and sufficient conditions of optimality are derived for the Neumann problem. A simple example of application is also presented.
Źródło:: Archives of Control Sciences; 2013, 23, 3; 261-279
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: A continuous-time distributed algorithm for solving a class of decomposable nonconvex quadratic programming
Autorzy:: Zhao, Y.
Liu, Q.
Powiązania:: https://bibliotekanauki.pl/articles/91832.pdf
Data publikacji:: 2018
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: decomposable nonconvex quadratic programming
multi-agent network
consensus
Lyapunov method
Opis:: In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 283-291
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Metaheuristic optimization of marginal risk constrained long - short portfolios
Autorzy:: Vijayalakshmi Pai, G. A.
Michel, T.
Powiązania:: https://bibliotekanauki.pl/articles/91858.pdf
Data publikacji:: 2012
Wydawca:: Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:: metaheuristic
optimization
portfolio optimization
marginal risk
quadratic programming
meta heuristic method
data envelopment analysis
Opis:: The problem of portfolio optimization with its twin objectives of maximizing expected portfolio return and minimizing portfolio risk renders itself difficult for direct solving using traditional methods when constraints reflective of investor preferences, risk management and market conditions are imposed on the underlying mathematical model. Marginal risk that represents the risk contributed by an asset to the total portfolio risk is an important criterion during portfolio selection and risk management. However, the inclusion of the constraint turns the problem model into a notorious non-convex quadratic constrained quadratic programming problem that seeks acceptable solutions using metaheuristic methods. In this work, two metaheuristic methods, viz., Evolution Strategy with Hall of Fame and Differential Evolution (rand/1/bin) with Hall of Fame have been evolved to solve the complex problem and compare the quality of the solutions obtained. The experimental studies have been undertaken on the Bombay Stock Exchange (BSE200) data set for the period March 1999-March 2009. The efficiency of the portfolios obtained by the two metaheuristic methods have been analyzed using Data Envelopment Analysis.
Źródło:: Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 3; 259-274
2083-2567
2449-6499
Pojawia się w:: Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: An SQP trust region method for solving the discrete-time linear quadratic control problem
Autorzy:: Mostafa, E. M. E.
Powiązania:: https://bibliotekanauki.pl/articles/331409.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: programowanie sekwencyjne
programowanie kwadratowe
system dyskretno-czasowy
output feedback control design
sequential quadratic programming
trust region method
Opis:: In this paper, a sequential quadratic programming method combined with a trust region globalization strategy is analyzed and studied for solving a certain nonlinear constrained optimization problem with matrix variables. The optimization problem is derived from the infinite-horizon linear quadratic control problem for discrete-time systems when a complete set of state variables is not available. Moreover, a parametrization approach is introduced that does not require starting a feasible solution to initiate the proposed SQP trust region method. To demonstrate the effectiveness of the method, some numerical results are presented in detail.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2012, 22, 2; 353-363
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
Autorzy:: Goyal, Vandana
Rani, Namrata
Gupta, Deepak
Powiązania:: https://bibliotekanauki.pl/articles/2175831.pdf
Data publikacji:: 2022
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:: multi-objective quadratic fractional programming model
MOQFPM
pentagonal fuzzy number
PFN
mean method of α-cut
parametric approach
ε-constraint method
Opis:: This study proposes a methodology to obtain an efficient solution for a programming model which is multi-objective quadratic fractional with pentagonal fuzzy numbers as coefficients in all the objective functions and constraints. The proposed approach consists of three stages. In the first stage, defuzzification of the coefficients is carried out using the mean method of α-cut. Then, in the second stage, a crisp multi-objective quadratic fractional programming model (MOQFP) is constructed to obtain a non-fractional model based on an iterative parametric approach. In the final stage, this multi- -objective non-fractional model is transformed to obtain a model with a single objective by applying the ε-constraint method. This final model is then solved to get desired solution. Also, an algorithm and flowchart expressing the methodology are given to present a clear picture of the approach. Finally, a numerical example illustrating the complete approach is given.
Źródło:: Operations Research and Decisions; 2022, 32, 1; 49--71
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

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ł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Development of a method for finding the optimal solution when upgrading a motorcycle engine
Autorzy:: Vrublevskyi, Oleksandr
Wojnowski, Radomir
Powiązania:: https://bibliotekanauki.pl/articles/298245.pdf
Data publikacji:: 2019
Wydawca:: Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:: spark ignition engine
thermodynamic cycle simulations
optimization
design of experiments
DoE
Monte Carlo method
Nonlinear Programming Quadratic Line search
NLPQL
Opis:: This paper describes a method for finding the optimal parameters of a spark-ignition engine gas exchange system for a motorcycle. The vectors of the initial data for filling the parameter space, in which the search for the optimal solution has been made, have been formed through methods of experiment planning and technique nonlinear programming quadratic line search. As the quality criteria, the engine power has been used at selected points of the external speed characteristic. The results of the work have shown how using the proposed optimization method allows modernization of a gas exchange systems in order to increase the engine power.
Źródło:: Technical Sciences / University of Warmia and Mazury in Olsztyn; 2019, 22(2); 135-149
1505-4675
2083-4527
Pojawia się w:: Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "quadratic programming method" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język