In this article, we study the persistence of properties of a given classical deterministic differential equation under a stochastic perturbation of two distinct forms: external and internal. The first case corresponds to add a noise term to a given equation using the framework of Itô or Stratonovich stochastic differential equations. The second case corresponds to consider a parameters dependent differential equations and to add a stochastic dynamics on the parameters using the framework of random ordinary differential equations. Our main concerns for the preservation of properties is stability/instability of equilibrium points and symplectic/Poisson Hamiltonian structures. We formulate persistence theorem in these two cases and prove that the cases of external and internal stochastic perturbations are drastically different. We then apply our results to develop a stochastic version of the Landau-Lifshitz equation. We discuss in particular previous results obtain by Etore and al. in [28] and we finally propose a new family of stochastic Landau-Lifshitz equations.
https://www.southampton.ac.uk/maths/about/staff/abz1e14.pageWhen the lower-level optimal solution set-valued mapping of a bilevel optimization problem is not singlevalued, we are faced with an ill-posed problem, which gives rise to the optimistic and pessimistic bilevel optimization problems, as tractable algorithmic frameworks. However, solving the pessimistic bilevel optimization problem is far more challenging than the optimistic one; hence, the literature has mostly been dedicated to the latter class of the problem. The Scholtes relaxation has appeared to be one of the simplest and efficient way to solve the optimistic bilevel optimization problem in its Karush-Kuhn-Tucker (KKT) reformulation or the corresponding more general mathematical program with complementarity constraints (MPCC). Inspired by such a success, this paper studies the potential of the Scholtes relaxation in the context of the pessimistic bilevel optimization problem. To proceed, we consider a pessimistic bilevel optimization problem, where all the functions involved are at least continuously differentiable. Then assuming that the lower-level problem is convex, the KKT reformulation of the problem is considered under the Slater constraint qualification. Based on this KKT reformulation, we introduce the corresponding version of the Scholtes relaxation algorithm. We then construct theoretical results ensuring that a sequence of global/local optimal solutions (resp. stationarity points) of the aforementioned Scholtes relaxation converges to a global/local optimal solution (resp. stationarity point) of the KKT reformulation of the pessimistic bilevel optimization. The results are accompanied by technical results ensuring that the Scholtes relaxation algorithm is well-defined or the corresponding parametric optimization can easily be solved.
Abstract. In this paper, we study the behaviors of fixed points sets of non necessarily pseudo-contractive multifunctions. Rather than comparing the images of the involved multifunctions, we make use of some conditions on the fixed points sets to establish general results on their stability and continuous dependence. We illustrate our results by applications to differential inclusions and give stability results of fixed points sets of non necessarily pseudo-contractive multifunctions with respect to the bounded proximal convergence.
We present fixed point theorems for a nonexpansive set-valued mapping from a closed convex subset of a reflexive Banach space into itself under some asymptotic contraction assumptions. Some existence results of coincidence points and eigenvalues for multimappings are given.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.