Next Article in Journal
Fuzzy Multi Criteria Decision Making Model for Agritourism Location Selection: A Case Study in Vietnam
Next Article in Special Issue
On Some Generalizations of Reverse Dynamic Hardy Type Inequalities on Time Scales
Previous Article in Journal
Various Series Related to the Polylogarithmic Function
Previous Article in Special Issue
BMO and Asymptotic Homogeneity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Approximate Optimal Control for a Parabolic System with Perturbations in the Coefficients on the Half-Axis

by
Olena A. Kapustian
1,2,
Oleksiy V. Kapustyan
3,
Anton Ryzhov
3,* and
Valentyn Sobchuk
3
1
Faculty of Computer Science and Cybernetics, Taras Shevchenko National University of Kyiv, 4D Academician Glushkov Avenue, 03127 Kyiv, Ukraine
2
Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università degli Studi dell’Aquila, Edificio “Renato Ricamo” (Coppito 1), Via Vetoio, Coppito, 67100 L’Aquila, Italy
3
Faculty of Mechanics and Mathematics, Taras Shevchenko National University of Kyiv, 4E Academician Glushkov Avenue, 03127 Kyiv, Ukraine
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(4), 175; https://doi.org/10.3390/axioms11040175
Submission received: 17 February 2022 / Revised: 1 April 2022 / Accepted: 12 April 2022 / Published: 14 April 2022
(This article belongs to the Special Issue Approximation Theory and Related Applications)

Abstract

:
In this paper, we use the averaging method to find an approximate solution in the optimal control problem of a parabolic system with non-linearity of the form f ( t / ε , y ) on an infinite time interval.

1. Introduction

Many results in the theory of asymptotic approximations have been obtained from 1930 onwards. Indeed, there were a lot of results on integral manifolds, equations with retarded argument, quasi- or almost-periodic equations etc. Earlier work on this theory has been presented in the famous book [1].
Averaging is a valuable method to understand the long-term evolution of dynamical systems characterized by slow dynamics and fast periodic or quasi-periodic dynamics. In [2], a transparent proof of the validity of averaging in the periodic case is presented. Different proofs for both the periodic and the general case are provided by [3,4]. In the last paper, moreover, the relation between averaging and the multiple time-scales method is established.
The averaging method for constructing approximate solutions in the theory of ODEs is presented in [5,6]. In [7], the asymptotic analysis of nonlinear dynamical systems is developed.
The work [8] is devoted to using an asymptotic method for studying the Cauchy problem for a 1D Euler–Poisson system, which represents a physically relevant hydrodynamic model but also a challenging case for a bipolar semiconductor device by considering two different pressure functions. In [9], the averaging results for ordinary differential equations perturbed by a small parameter are proved. Here, authors assume only that the right-hand sides of the equations are bounded by some locally Lebesgue integrable functions with the property that their indefinite integrals satisfy a Lipschitz-type condition.
In [10], the authors prove that averaging can be applied to the extremal flow of optimal control problems with two fast variables, that is considerably more complex because of resonances.
The averaging method is one of the most effective tools for constructing approximate solutions, including optimal control problems for ODEs [11] and PDEs [12], where the autors consider the optimal control problem in coefficients in the so-called class of H-admissible solutions.
The Krasnoselski–Krein theorem and its various modifications [13,14,15] play an essential role in all such considerations, since it guarantees the limit transition in perturbed problem with fast-oscillating coefficients of the form a t ε as ε 0 .
The typical averaging problem may be defined as follows: one considers an unperturbed problem in which the slow variables remain fixed. Upon perturbation, a slow drift appears in these variables which one would like to approximate independently of the fast variables.
In the present paper we use this approach to nonlinear parabolic system with fast-oscillating (w.r.t. time variable) coefficients f t ε , y on an infinite time interval. We prove that the optimal control of the problem with averaging coefficients can be considered to be ”approximately” optimal for the initial perturbed system.

2. Statement of the Problem

Let Ω R d be a bounded domain. In cylinders Q = ( 0 , + ) × Ω we consider an initial boundary-value problem for a parabolic system [16,17]
y t = A Δ y + f t ε , y + g ( y ) · u ( t , x ) , ( t , x ) Q , y Ω = 0 , y t = 0 = y 0 ( x ) .
Here ε > 0 is a small parameter, A is a real N × N matrix, f is a given vector-valued mapping, g is a given matrix-valued mapping, y = ( y 1 , , y N ) is an unknown state function, u = ( u 1 , , u M ) is an unknown control function, which are determined by requirements
u U ( L 2 ( Q ) ) M ,
J ( y , u ) = Q e γ · t · q x , y ( t , x ) d t d x + Q i = 1 M α i · u i 2 ( t , x ) d t d x inf ,
where γ , α 1 , , α M are positive constants.
Under the natural assumptions on A , f , g , U , q we prove, that the optimal control problem (1)–(3) has a solution { y ¯ ε , u ¯ ε } , i.e., for every u U and for any solution y ε of (1) with control u we have
J y ¯ ε , u ¯ ε J ( y ε , u )
In what follows we consider the problem of finding an approximate solution of (1)–(3) by transition to averaged coefficients. For this purpose we assume that uniformly w.r.t. y R N there exists
f ¯ ( y ) : = lim T 1 T 0 T f ( s , y ) d s .
We consider the following optimal control problem
y t = A Δ y + f ¯ ( y ) + g ( y ) · u ( t , x ) , ( t , x ) Q , y Ω = 0 , y t = 0 = y 0 ( x ) ,
u U ( L 2 ( Q ) ) M ,
J ( y , u ) = Q e γ · t · q x , y ( t , x ) d t d x + Q i = 1 M α i · u i 2 ( t , x ) d t d x inf .
It should be noted that the transition to the averaging parameters can essentially simplify the problem. In particular, if f ¯ does not depend on y then in some cases exact solution of (1)–(3) can be found [18,19]. Another approaches for finding exact solutions of optimal control problems and approximate procedures can be found in [20,21].
Assume that { y ¯ , u ¯ } is a solution of (5)–(7). The main goal of the paper is to prove the limit equality
J y ¯ ε , u ¯ ε J ( y ¯ , u ¯ ) 0 , ε 0 .
As a consequence of (8) we will prove that the control u ¯ is approximately optimal for the problem (1)–(3) in the following sense:
J y ¯ ε , u ¯ ε J ( y ε , u ¯ ) 0 , ε 0 ,
where y ε is a solution of (1) with control u ¯ .

3. Assumptions, Notations and Basic Results

We assume the following conditions hold.
Assumption 1.
1 2 A + A * v · I , where v > 0 and I is a unit matrix;
Assumption 2.
f : R + × R N R N is continuous and bounded:
C 1 > 0 t 0 y R N f ( t , y ) R N C 1 ;
Assumption 3.
g : R N R N × M is continuous and bounded:
C 2 > 0 y R N g ( y ) R N × M C 2 ;
Assumption 4.
U L 2 ( Q ) M is closed and convex, 0 U ;
Assumption 5.
q : Ω × R N R is a Carathéodory function, K 1 , K 2 L 1 ( Ω ) , C 3 > 0 such that x Ω , ξ R N
| q ( x , ξ ) | C 3 ξ R N 2 + K 2 ( x ) , q ( x , ξ ) K 1 ( x ) .
Here, ξ R N denotes the Euclidean norm of ξ R N .
For u U and y 0 L 2 ( Ω ) N we understand solution of (1) in weak (or generalized) sense on every finite time interval, i.e., y is a solution of (1) if
y L l o c 2 0 , + , ( H 0 1 ( Ω ) ) N L l o c 0 , + , ( L 2 ( Ω ) ) N
such that T > 0 , φ ( H 0 1 ( Ω ) ) N , η C 0 ( 0 , T ) the following equality holds:
0 T ( y , φ ) H · η d t + 0 T ( A y , φ ) H η d t = 0 T f t ε , y , φ H η d t + 0 T g ( y ) · u , φ H η d t .
Here and after we denote by · H and ( · , · ) H the classical norm and scalar product in H : = ( L 2 ( Ω ) ) N , by · V and ( · , · ) V the classical norm and scalar product in V : = ( H 0 1 ( Ω ) ) N , by · U the norm in L 2 ( Q ) ) M , and by V * the dual space to V.
Due to the Assumptions 1–3, every solution of (1) satisfies
y t L l o c 2 ( 0 , + , V * ) .
It means that T > 0 every solution of (1) is an absolutely continuous function from [ 0 , T ] to H, and equality (9) is equivalent to the following one [16]:
d d t y , φ H + A y , φ H = f t ε , y , φ H + ( g ( y ) · u , φ ) H
for almost all (a.a.) t > 0 .
It is known [16,17] that, under Assumptions 1–3, for every y 0 H , u U there exists at least one solution of (1), and for a.a. t > 0
1 2 d d t y ( t ) H 2 + v · y ( t ) V 2 C 1 y ( t ) H + C 2 y ( t ) H · u ( t ) ( L 2 ( Ω ) ) M .
Remark 1.
Uniqueness of solution of (1) is not guaranteed. This can be done under some additional assumptions, e.g., [16] s 0 , y R N , ω R N
f y ( s , y ) ω , ω R N C 4 · ω R N
In the sequel, we denote by F ε (or F ¯ ) a set of all pairs { y , u } , where y is a solution of (1) (or (5)) with control u.
The following Lemma gives us a result about the solvability of the optimal control problem (1)–(3) and it also provides some useful inequalities.
Lemma 1.
Under the Assumptions 1–5 for every ε > 0 the problem (1)–(3) has a solution { y ¯ ε , u ¯ ε } , that is,
J ( y ¯ ε , u ¯ ε ) J ( y , u ) { y , u } F ε .
Proof of Lemma 1.
Fix ε > 0 and suppress index ε throughout the proof. The idea of the proof is to derive a priori estimates for the minimizing sequence. Obtained estimates allow us to pass to the limit in problem (1)–(3).
From (11), Poincare inequality y V 2 λ y H 2 , y V , and Young inequality we derive that for some δ > 0 , C 5 > 0 (not depending on ε ) for every { y , u } F ε for a.a. t > 0
d d t y ( t ) H 2 + δ y ( t ) H 2 C 5 1 + u ( t ) ( L 2 ( Ω ) ) M 2 .
Therefore using Gronwall inequality we get for all t > 0
y ( t ) H 2 e δ · t y 0 ( t ) H 2 + C 5 0 t 1 + u ( s ) ( L 2 ( Ω ) ) M 2 e δ · s d s ,
y ( t ) H 2 e δ · t y 0 H 2 + C 5 δ + C 5 · u U 2 .
From the inequality (13) and the first inequality from the Assumption 5 we have that for some C 6 > 0
J ( y , u ) C 6 1 + y 0 H 2 + u U 2 .
Now let { y n , u n } be a minimizing sequence, that is,
lim n J ( y n , u n ) = inf { y , u } F ε J ( y , u ) = : J ¯ ε .
Note that due to the Assumption 5 { y , u } F ε
J ( y , u ) K 1 L 1 γ J ¯ ε K 1 L 1 γ > .
From (15) for sufficiently large n
J ( y n , u n ) J ¯ ε + 1 .
On the other hand, for α : = min 1 i M α i > 0
J ( y n , u n ) K 1 L 1 γ + α · u n U 2 .
Inequalities (16) and (17) imply that { u n } is bounded in ( L 2 ( Q ) ) M , so for subsequence
u n u weakly in ( L 2 ( Q ) ) M .
Due to convexity of U we have inclusion u U . From (11) over ( 0 , T ) and using (13) we we obtain from (5) that { y n } is bounded in
L 2 ( 0 , T ; V ) L ( 0 , T ; H ) ,
y n t is bounded in L 2 ( 0 , T ; V * ) . Using Compactness Lemma [22] we conclude that up to subsequence T > 0
y n y weakly in L 2 ( 0 , T ; V ) ,
y n y in L 2 ( 0 , T ; H ) ,
t 0 y n ( t ) y ( t ) weakly in H ,
y n ( t , x ) y ( t , x ) a . a . in Q .
From (19) and Lebesgue’s Dominated Convergence Theorem we can pass to the limit in the equality (9) applied to { y n , u n } , and obtain that { y , u } F ε . Due to pointwise convergence
e γ · t · q ( x , y n ( t , x ) ) e γ · t q ( x , y ( t , x ) ) a . a . in Q ,
Fatou’s lemma and weak convergence (18) we have
J ¯ ε = lim n J ( y n , u n ) lim ̲ Q e γ · t q ( x , y n ( t , x ) ) d t d x + lim ̲ Q i = 1 M α i ( u i n ( t , x ) ) 2 d t d x J ( y , u ) .
Therefore { y , u } is a solution of (1)–(3). □

4. Main Results

We assume that η > 0 δ > 0 t 0 , y , z R N
y z R N < δ f ( t , y ) f ( t , z ) R N < η .
Assumption (20) implies that the averaged function f ¯ : R N R N from (4) is a continuous function and the Assumption 2 holds. It means that under conditions (4), (20) the optimal control problem (5)–(7) has a solution { y ¯ , u ¯ } .
The main result of the paper is the following
Theorem 1.
Suppose that the Assumptions 1–5 and (4), (20) hold and, moreover, the problem (5) has a unique solution for every u U . Let { y ¯ ε , u ¯ ε } be a solution of (1)–(3). Then
J ( y ¯ ε , u ¯ ε ) J ( y ¯ , u ¯ ) , ε 0 ,
and up to subsequence
y ¯ ε y ¯ in L l o c 2 ( 0 , + ; H ) ,
u ¯ ε u ¯ in ( L 2 ( Q ) ) M ,
where { y ¯ , u ¯ } is a solution of (5)–(7).
Proof. 
Let ε n 0 , { y ¯ n , u ¯ n } be a solution of (1)–(3) for ε = ε n . Due to the optimality of { y ¯ n , u ¯ n } we have
J ( y ¯ n , u ¯ n ) J ( y n , 0 ) ,
where y n is a solution of (1) with ε = ε n and u 0 . Then from (14)
1 γ K 1 L 1 + α u ¯ n U 2 C 6 · ( 1 + y 0 H 2 ) .
Repeating arguments used in the prof of Lemma 1 conclude that on subsequence for some y ^ , u ^ :
u ¯ n u ^ weakly in ( L 2 ( Q ) ) M , n ,
y ¯ n y ^ in the sense of ( ) , n ,
Let us prove that { y ^ , u ^ } F ¯ , i.e., y ^ is a solution of the averaged problem (5) with control u ^ . For this purpose it is sufficient to make a limit transition in the equality
y ¯ n , φ H ( y 0 , φ ) H + 0 T A y ¯ n , φ H = 0 T f t ε n , y ¯ n , φ H + 0 T g ( y ¯ n ) u ¯ n , φ ) H ,
for arbitrary φ V and T > 0 .
Limit transition in the left part of (24) is a direct consequence of (23). From the Dominated Convergence Theorem we see that
g ( y ¯ n ) g ( y ^ ) in L 2 ( 0 , T ; H ) , n .
Then (23) implies convergence in the last term of (24).
Let us prove that T > 0 , φ V
Q T i = 1 N f i t ε n , y ¯ n ( t , x ) φ i ( x ) d t d x Q T i = 1 N f ¯ i y ^ ( t , x ) φ i ( x ) d t d x , n ,
where Q T = ( 0 , T ) × Ω . Due to the Dominated Convergence Theorem 0 < a < b , ψ H
a b Ω i = 1 N f i t ε n , ψ ( x ) f ¯ i ( ψ ( x ) ) φ i ( x ) d x d t 0 , n .
Due to Egorov’s theorem δ > 0 Q 1 δ Q T such that μ ( Q 1 δ ) < δ and
y ¯ n y ^ uniformly on Q T Q 1 δ as n .
Here μ is Lebesgue’s measure on R 2 . On the other hand there exists a sequence of step functions
y m ( t , x ) = k = 1 m y k m ( x ) · χ A k m ( t ) , { y k m } H ,
{ A k m = ( a k m , b k m ) } is a covering of ( 0 , T ) such that
y m y ^ in L 2 ( 0 , T ; H ) and a . e . in Q T .
Moreover δ > 0 Q 2 δ Q T such that μ ( Q 2 δ ) < δ and
y m y ^ uniformly on Q T Q 2 δ as m .
Let us denote
I 1 ( n ) : = Q T i = 1 N f i t ε n , y ¯ n ( t , x ) f i t ε n , y ^ ( t , x ) φ i ( x ) d t d x , I 2 ( n ) : = Q T i = 1 N f i t ε n , y ^ ( t , x ) f ¯ y ^ ( t , x ) φ i ( x ) d t d x .
Then due to (27)
I 1 ( n ) Q T Q 1 δ f t ε n , y ¯ n ( t , x ) f t ε n , y ^ ( t , x ) R N · φ ( x ) R N d t d x + 2 C 1 · φ H 1 2 · δ 1 2 .
Due to (20) for a given δ > 0 λ n 1 , t 0
y z R N < λ f t ε n , y f t ε n , z δ 1 2 .
Therefore, choosing n 1 such that n n 1
sup ( t , x ) Q T Q 1 δ y ¯ n ( t , x ) y ^ ( t , x ) R N < λ
we get from (28) that n n 1
I 1 ( n ) δ 1 2 · μ 1 2 ( Q T ) · φ H 1 2 + 2 C 1 · φ H 1 2 · δ 1 2 C 7 ( T ) δ 1 2 .
On the other hand, for every step function y m ( t , x ) we have due to (26): m 1
Q T i = 1 N f i t ε n , y m ( t , x ) f ¯ i y m ( t , x ) φ i ( x ) d t d x = k = 1 m A k m Ω i = 1 N f i t ε n , y k m ( x ) f ¯ i y k m ( x ) φ i ( x ) d t d x 0 , n .
So m 1 , n 2 = n 2 ( m ) , n n 2
Q T i = 1 N f i t ε n , y m ( t , x ) f ¯ i y m ( t , x ) φ i ( x ) d t d x < δ .
Furthermore, m 0 , m m 0 , n 1
Q T Q 2 δ f t ε n , y ^ ( t , x ) f t ε n , y m ( t , x ) R N · φ ( x ) R N d t d x δ 1 2 · μ 1 2 ( Q T ) · φ H 1 2 ,
Q T Q 2 δ f ¯ ( y ^ ( t , x ) ) f ¯ ( y m ( t , x ) ) R N · φ ( x ) R N d t d x δ 1 2 · μ 1 2 ( Q T ) · φ H 1 2 .
Combining (30)–(33), we obtain m m 0 , n n 2 ( m )
I 2 ( n ) 2 · δ 1 2 · μ 1 2 ( Q T ) φ H 1 2 + δ C 8 ( T ) · δ 1 2 .
Inequalities (29), (34) imply (25). So we can pass to the limit in (24) and obtain that { y ^ , u ^ } F ¯ . Now let us prove that { y ^ , u ^ } is an optimal process in (5)–(7).
Fatou’s lemma implies
lim ̲ J ( y ¯ n , u ¯ n ) J ( y ^ , u ^ ) .
On the other hand, for every u U and any y n –solution of (1) with control u and ε = ε n we get
J ( y ¯ n , u ¯ n ) J ( y ¯ n , u ) .
Using the same arguments as in proof of the Lemma 1 for { y n } we derive that
y n y in the sense of ( 19 ) ,
where y is a unique solution of (5) with control u.
Let us prove that
Q e γ · t q ( x , y n ( t , x ) ) d t d x Q e γ · t q ( x , y ( t , x ) ) d t d x
Indeed due to the Assumption 5 and (13) we have
e γ · t q ( x , y n ( t , x ) ) C 3 e γ · t y n ( t , x ) R N 2 + e γ · t · K 2 ( x ) .
As y n y in L 2 ( 0 , T ; H ) and a.e. in Q, we deduce from Lebesgue’s Dominated Convergence theorem:
T > 0 Q T e γ · t q ( x , y n ( t , x ) ) d t d x Q T e γ · t q ( x , y ( t , x ) ) d t d x , n .
On the other hand, from (12) and (36)
T + Ω e γ · t | q ( x , y n ( t , x ) ) | d t d x T + e γ · t C 3 · y n ( t ) H 2 + K 2 L 1 d t T + e γ · t C 3 e δ · t · y 0 ( t ) H 2 + C 3 · C 5 δ + C 3 · C 5 · u U 2 + K 2 L 1 d t C 9 · e γ · T ,
where C 9 does not depend on T and n. The last inequality together with with (37) leads to (35).
From (35) we conclude the following inequality: { y , u } F ¯
J ( y ^ , u ^ ) lim ̲ J ( y ¯ n , u ¯ n ) lim ̲ J ( y n , u ) = J ( y , u ) .
This means that { y ^ , u ^ } is a solution of (5)–(7).
Now we substitute u = u ^ in previous arguments. Then y = y ^ due to uniqueness. So from (39), we obtain
J ( y ^ , u ^ ) lim ̲ J ( y ¯ n , u ¯ n ) J ( y ^ , u ^ ) .
These inequalities mean that up to subsequence
J ( y ¯ n , u ¯ n ) J ( y ^ , u ^ ) , n .
Since J ( y ^ , u ^ ) = inf { y , u } F ¯ J ( y , u ) , then convergence in (40) holds for the whole sequence. Therefore (21) is proved.
Moreover, up to subsequence y ¯ n tends to y ^ in L l o c 2 ( 0 , + ; H ) . So, repeating arguments (37) and (38) for y ¯ n , and using boundness of { u ¯ n } , we have
Q e γ · t q ( x , y ¯ n ( t , x ) ) d t d x Q e γ · t q ( x , y ^ ( t , x ) ) d t d x .
Then from (40) and weak convergence we deduce (22) □
Corollary 1.
An optimal control u ¯ U of the averaged problem (5)–(7) can serve as an ”approximate” optimal control in the initial problem (1), that is:
J ( y ¯ ε , u ¯ ε ) J ( y ε , u ¯ ) 0 , ε 0 ,
where y ε is a solution of (1) with control u = u ¯ .
Indeed, for y ε n , ε n 0 , we can repeat arguments of the proof of the Theorem, and due to the uniqueness of the solution of (5) for u = u ¯ we have up to subsequence
y ε n y ¯ in the sense of ( 19 )
Then (35) holds and taking into account strong convergence (22), we obtain (41).

5. Conclusions and Future Research

We sought to obtain a theoretical result that demonstrates the effectiveness of the averaging method of finding an approximate solution of the optimal control problem for a non-linear parabolic system with fast-oscillating coefficients with respect to a time variable. We proved that the optimal control of the problem with averaging coefficients can be considered as an ”approximately” optimal for the initial perturbed system. To demonstrate effectiveness of the method we plan to continue research focusing on the practical applications and simulation results using in particular genetic algorithms.

Author Contributions

Conceptualization, O.A.K., O.V.K., A.R. and V.S.; methodology, O.A.K., O.V.K., A.R. and V.S.; formal analysis, O.A.K., O.V.K., A.R. and V.S.; investigation, O.A.K., O.V.K., A.R. and V.S.; writing—original draft preparation, O.A.K., O.V.K., A.R. and V.S.; writing—review and editing, O.A.K., O.V.K., A.R. and V.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bogoliubov, N.N.; Mitropolsky, Y.A. Asymptotic Methods in the Theory of Non-Linear Oscillations; Gordon and Breach: New York, NY, USA, 1961. [Google Scholar]
  2. Roseau, M. Vibrations nonlinéaires et théorie de la stabilité; Springer: Berlin, Germany, 1966. [Google Scholar]
  3. Besjes, J.G. On the asymptotic methods for non-linear differential equations. J. Mécanique 1969, 8, 357–373. [Google Scholar]
  4. Perko, L.M. Higher order averaging and related methods for perturbed periodic and quasi-periodic systems. SIAM J. Appl. Math. 1969, 17, 698–724. [Google Scholar] [CrossRef]
  5. Lochak, P.; Meunier, C. Multiphase Averaging for Classical Systems; Springer: New York, NY, USA, 1988. [Google Scholar]
  6. Samoilenko, A.M.; Stanzhitskyi, A.N. On averaging differential equations on an infinite interval. Differ. Uravn. 2006, 42, 476–482. [Google Scholar] [CrossRef]
  7. Sanders, J.A.; Verhulst, F. Averaging Methods in Nonlinear Dynamical Systems; Springer: New York, NY, USA, 1985. [Google Scholar]
  8. Donatella Donatelli, D.; Mei, M.; Rubino, B.; Sampalmieri, R. Asymptotic behavior of solutions to Euler–Poisson equations for bipolar hydrodynamic model of semiconductors. J. Differ. Equ. 2013, 255, 3150–3184. [Google Scholar] [CrossRef]
  9. Lakrib, M.; Kherraz, T.; Bourada, A. Averaging for ordinary differential equations perturbed by a small parameter. Math. Bohem. 2016, 141, 143–151. [Google Scholar] [CrossRef] [Green Version]
  10. Dell’Elce, L.; Caillau, J.-B.; Pomet, J.-B. Considerations on Two-Phase Averaging of Time-Optimal Control Systems. Available online: https://hal.inria.fr/hal-01793704v3 (accessed on 31 March 2022).
  11. Nosenko, T.V.; Stanzhytskyi, O.M. Averaging method in some problems of optimal control. Nonlin. Osc. 2008, 11, 539–547. [Google Scholar] [CrossRef]
  12. Ciro D’Apice, C.; De Maio, U.; Kogut, O.P. Optimal Control Problems in Coefficients for Degenerate Equations of Monotone Type: Shape Stability and Attainability Problems. SIAM J. Control Optim. 2012, 50, 1174–1199. [Google Scholar] [CrossRef]
  13. Kichmarenko, O.; Stanzhytskyi, O. Sufficient conditions for the existence of optimal control for some classes of functional-differential equations. Nonlin. Dyn. Syst. Theory 2018, 18, 196–211. [Google Scholar]
  14. Plotnikova, N.V. The Krasnoselskii-Krein theorem for differential inclusions. Differ. Uravn. 2005, 41, 997–1000. [Google Scholar]
  15. Gamma, R.; Guerman, A.; Smirnov, G. On the asymptotic stability of discontinuous systems via the averaging method. Nonlin. Ann. 2011, 74, 1513–1522. [Google Scholar] [CrossRef] [Green Version]
  16. Chepyzhov, V.V.; Visnik, M.I. Attractors for Equations of Mathematical Physics; AMS: Providence, RI, USA, 2002. [Google Scholar]
  17. Kapustyan, O.V.; Kasyanov, P.O.; Valero, J. Structure of the global attractor for weak solutions of a reaction-diffusion equation. Appl. Math. Inf. Sci. 2015, 9, 2257–2264. [Google Scholar]
  18. Kapustian, O.A.; Sobchuk, V.V. Approximate homogenized synthesis for disturbed optimal control problem with superposition type cost functional. Stat. Opt. Inf. Comp. 2018, 6, 233–239. [Google Scholar]
  19. Kapustian, E.A.; Nakonechny, A.G. The minimax problems of pointwise observation for a parabolic boundary-value problem. J. Autom. Inf. Sci. 2002, 34, 52–63. [Google Scholar]
  20. Pichkur, V.V.; Sobchuk, V.V. Mathematical Model and Control Design of a Functionally Stable Technological Process. Diff. Eq. App. 2021, 29, 32–41. [Google Scholar] [CrossRef]
  21. Garashchenko, F.G.; Pichkur, V.V. Structural optimization of dynamic systems by use of generalized Bellman’s principle. J. Autom. Inf. Sci. 2000, 32, 1–6. [Google Scholar]
  22. Sell, G.R.; You, Y. Dynamics of Evolutionary Equations; Springer: New York, NY, USA, 2002. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kapustian, O.A.; Kapustyan, O.V.; Ryzhov, A.; Sobchuk, V. Approximate Optimal Control for a Parabolic System with Perturbations in the Coefficients on the Half-Axis. Axioms 2022, 11, 175. https://doi.org/10.3390/axioms11040175

AMA Style

Kapustian OA, Kapustyan OV, Ryzhov A, Sobchuk V. Approximate Optimal Control for a Parabolic System with Perturbations in the Coefficients on the Half-Axis. Axioms. 2022; 11(4):175. https://doi.org/10.3390/axioms11040175

Chicago/Turabian Style

Kapustian, Olena A., Oleksiy V. Kapustyan, Anton Ryzhov, and Valentyn Sobchuk. 2022. "Approximate Optimal Control for a Parabolic System with Perturbations in the Coefficients on the Half-Axis" Axioms 11, no. 4: 175. https://doi.org/10.3390/axioms11040175

APA Style

Kapustian, O. A., Kapustyan, O. V., Ryzhov, A., & Sobchuk, V. (2022). Approximate Optimal Control for a Parabolic System with Perturbations in the Coefficients on the Half-Axis. Axioms, 11(4), 175. https://doi.org/10.3390/axioms11040175

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop