Sweeping process with right uniformly lower semicontinuous mappings (Q2299378)

From MaRDI portal
Revision as of 19:14, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sweeping process with right uniformly lower semicontinuous mappings
scientific article

    Statements

    Sweeping process with right uniformly lower semicontinuous mappings (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2020
    0 references
    The authors consider the sweeping process \[ -\dot{x}(t)\in N^{P}\left( C(t),x(t)\right) \text{ a.e. on }\left[T_{0},T\right], \] \[ x\left( T_{0}\right) =x_{0}\in C\left( T_{0}\right) \] where \(N^{P}\) denotes the proximal normal cone in an infinite-dimensional separable Hilbert space. \(C\) is assumed to be prox regular and closed set valued, and uniformly lower semicontinuous from the right. Existence and uniqueness of solutions are proven by constructing a sequence of approximate solutions using a discretization scheme from [\textit{L. Thibault}, J. Convex Anal. 23, No. 4, 1051--1098 (2016; Zbl 1360.34032)]. Next, as a corollary, the authors prove existence and uniqueness for the problem with a single-valued, bounded and measurable perturbation term. Next, the existence of solutions is proven for a set-valued perturbation which is closed and convex valued, and is scalarly upper semicontinuous with respect to both variables. Finally, using an idea from [\textit{J. Noel} and \textit{L. Thibault}, Vietnam J. Math. 42, No. 4, 595--612 (2014; Zbl 1315.34068)], this last result is extended to one which holds on an unbounded interval.
    0 references
    sweeping process
    0 references
    proximal normal cone
    0 references
    prox regular set
    0 references
    existence and uniqueness
    0 references
    perturbation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references