Convex sweeping process in the framework of measure differential inclusions and evolution variational inequalities

In this paper, we analyze and discuss the well-posedness of two new variants of the so-called sweeping process, introduced by Moreau in the early 70s (Moreau in Sem Anal Convexe Montpellier, 1971) with motivation in plasticity theory. The first new variant is concerned with the perturbation of the normal cone to the moving convex subset $$C(t)$$ C ( t ) , supposed to have a bounded variation, by a Lipschitz mapping. Under some assumptions on the data, we show that the perturbed differential measure inclusion has one and only one right continuous solution with bounded variation. The second variant, for which a large analysis is made, concerns a first order sweeping process with velocity in the moving set $$C(t)$$ C ( t ) . This class of problems subsumes as a particular case, the evolution variational inequalities [widely used in applied mathematics and unilateral mechanics (Duvaut and Lions in Inequalities in mechanics and physics. Springer, Berlin, 1976]. Assuming that the moving subset $$C(t)$$ C ( t ) has a continuous variation for every $$t\in [0,T]$$ t ? [ 0 , T ] with $$C(0)$$ C ( 0 ) bounded, we show that the problem has at least a Lipschitz continuous solution. The well-posedness of this class of sweeping process is obtained under the coercivity assumption of the involved operator. We also discuss some applications of the sweeping process to the study of vector hysteresis operators in the elastoplastic model (Krejă?i in Eur J Appl Math 2:281---292, 1991), to the planning procedure in mathematical economy (Henry in J Math Anal Appl 41:179---186, 1973 and Cornet in J. Math. Anal. Appl. 96:130---147, 1983), and to nonregular electrical circuits containing nonsmooth electronic devices like diodes (Acary et al. Nonsmooth modeling and simulation for switched circuits. Lecture notes in electrical engineering. Springer, New York 2011). The theoretical results are supported by some numerical simulations to prove the efficiency of the algorithm used in the existence proof. Our methodology is based only on tools from convex analysis. Like other papers in this collection, we show in this presentation how elegant modern convex analysis was influenced by Moreau's seminal work.