2020
DOI: 10.3934/eect.2020004
|View full text |Cite
|
Sign up to set email alerts
|

Multi-valued perturbation to evolution problems involving time dependent maximal monotone operators

Abstract: In this paper, we study the existence of solutions for evolution problems of the form − du dr (t) ∈ A(t)u(t)+F (t, u(t))+f (t, u(t)), where, for each t, A(t) : D(A(t)) → 2 H is a maximal monotone operator in a Hilbert space H with continuous, Lipschitz or absolutely continuous variation in time. The perturbation f is separately integrable on [0, T ] and separately Lipschitz on H, while F is scalarly measurable and separately scalarly upper semicontinuous on H, with convex and weakly compact values. Several new… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
16
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(17 citation statements)
references
References 21 publications
1
16
0
Order By: Relevance
“…We mentioned [439,427] as classical references on this topic, but similar results can be found in [147,209,512,531,446,445,444,559,199,116,487]. Among extensions and similar studies, we also find discretization for different kinds of variational inequalities [27,23,43,388,462], set-valued perturbations [169,237], state-dependent FOSwP [39,46,26,170,293,296,376], time-delay FOSwP and SOSwP [235,236,117,450,174,177], time-dependent maximal monotone DIs [64,153], proximal algorithms, i.e., implicit or backward Euler discretization of (2.16), for optimization problems [48,57,286,412,477] (it is known that an explicit Euler method has strong drawbacks [477,Sections 3.3,6.3]). Systems with prox-regular set-valued mappings have also been studied using time-stepping algorithms [42,…”
Section: 26supporting
confidence: 70%
See 2 more Smart Citations
“…We mentioned [439,427] as classical references on this topic, but similar results can be found in [147,209,512,531,446,445,444,559,199,116,487]. Among extensions and similar studies, we also find discretization for different kinds of variational inequalities [27,23,43,388,462], set-valued perturbations [169,237], state-dependent FOSwP [39,46,26,170,293,296,376], time-delay FOSwP and SOSwP [235,236,117,450,174,177], time-dependent maximal monotone DIs [64,153], proximal algorithms, i.e., implicit or backward Euler discretization of (2.16), for optimization problems [48,57,286,412,477] (it is known that an explicit Euler method has strong drawbacks [477,Sections 3.3,6.3]). Systems with prox-regular set-valued mappings have also been studied using time-stepping algorithms [42,…”
Section: 26supporting
confidence: 70%
“…(Perturbation) Classical FOSwP involves single-valued perturbations. However many articles consider set-valued perturbations f (t, x) [67,65,64,169,241,296,338,444,446,535] (initiated in [425], see also [169] for references to the Séminaire d'Analyse Convexe de Montpellier), integral perturbations are studied in [203,119].…”
Section: (Non-convex S(t))mentioning
confidence: 99%
See 1 more Smart Citation
“…For some contributions on the first-order differential inclusions governed by subdifferential operators and sweeping processes, we refer to [7]- [22] and the references therein. For the more general time-dependent maximal monotone operators case, the reader is referred to [23,24,25,26].…”
Section: Introductionmentioning
confidence: 99%
“…Several related results have been developed in [31] and [32] for the case that the sets C(t) are uniformly prox-regular and move with bounded variation. Dealing with time-dependent maximal monotone operator A(t) instead of ∂ ϕ(t, •) in the variant above, we refer to [23]. We will proceed, to state the main existence theorem, by a discretisation method.…”
Section: Introductionmentioning
confidence: 99%