Some remarks on subdifferentiability of convex functions.
Mean value inequalities are shown for functions which are sub- or super-differentiable at every point.
Two properties concerning the space of differences of sublinear functions D(X) for a real Banach space X are proved. First, we show that for a real separable Banach space (X,‖·‖) there exists a countable family of seminorms such that D(X) becomes a Fréchet space. For X = ℝ^n this construction yields a norm such that D(ℝ^n) becomes a Banach space. Furthermore, we show that for a real Banach space with a smooth dual every sublinear Lipschitzian function can be expressed by the Fenchel conjugate of...
We consider a quadratic control problem with a semilinear state equation depending on a small parameter . We show that the optimal control is a regular function of such parameter.
A justification of heterogeneous membrane models as zero-thickness limits of a cylindral three-dimensional heterogeneous nonlinear hyperelastic body is proposed in the spirit of Le Dret (1995). Specific characterizations of the 2D elastic energy are produced. As a generalization of Bouchitté et al. (2002), the case where external loads induce a density of bending moment that produces a Cosserat vector field is also investigated. Throughout, the 3D-2D dimensional reduction is viewed as a problem...
A justification of heterogeneous membrane models as zero-thickness limits of a cylindral three-dimensional heterogeneous nonlinear hyperelastic body is proposed in the spirit of Le Dret (1995). Specific characterizations of the 2D elastic energy are produced. As a generalization of Bouchitté et al. (2002), the case where external loads induce a density of bending moment that produces a Cosserat vector field is also investigated. Throughout, the 3D-2D dimensional reduction is viewed as a problem...
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect...
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with...