Displaying similar documents to “Hölder equivalence of the value function for control-affine systems”

The structure of reachable sets for affine control systems induced by generalized Martinet sub-lorentzian metrics

Marek Grochowski (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we investigate analytic affine control systems q ˙ = ,  ∈  [] , where is an orthonormal frame for a generalized Martinet sub-Lorentzian structure of order of Hamiltonian type. We construct normal forms for such systems and, among other things, we study the connection between the presence of the singular trajectory starting at on the boundary of the reachable set from with the minimal number of analytic functions needed for...

Strong stabilization of controlled vibrating systems

Jean-François Couchouron (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper deals with feedback stabilization of second order equations of the form + + = 0, ∈ [0, +∞[, where is a densely defined positive selfadjoint linear operator on a real Hilbert space with compact inverse and is a linear map in diagonal form. It is proved here that the classical sufficient ad-condition of Jurdjevic-Quinn and Ball-Slemrod with the feedback control = ⟨, ...

Strong stabilization of controlled vibrating systems

Jean-François Couchouron (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper deals with feedback stabilization of second order equations of the form ytt + A 0 y + u (t) B 0 y (t) = 0, t ∈ [0, +∞[, where A ...

Local semiconvexity of Kantorovich potentials on non-compact manifolds

Alessio Figalli, Nicola Gigli (2011)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove that any Kantorovich potential for the cost function = /2 on a Riemannian manifold (, ) is locally semiconvex in the “region of interest”, without any compactness assumption on , nor any assumption on its curvature. Such a region of interest is of full -measure as soon as the starting measure does not charge – 1-dimensional rectifiable sets.

Means in complete manifolds: uniqueness and approximation

Marc Arnaudon, Laurent Miclo (2014)

ESAIM: Probability and Statistics

Similarity:

Let be a complete Riemannian manifold,  ∈ ℕ and  ≥ 1. We prove that almost everywhere on  = ( ,, ) ∈  for Lebesgue measure in , the measure μ ( x ) = N ∑ k = 1 N x k μ ( x ) = 1 N ∑ k = 1 N δ x k has a unique–mean (). As a consequence, if  = ( ,, ) is a -valued random variable with absolutely continuous law, then almost surely (()) has a unique –mean. In particular if ( ...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Trivial Cases for the Kantorovitch Problem

Serge Dubuc, Issa Kagabo, Patrice Marcotte (2010)

RAIRO - Operations Research

Similarity:

Let and be two compact spaces endowed with respective measures and satisfying the condition . Let be a continuous function on the product space . The mass transfer problem consists in determining a measure on whose marginals coincide with and , and such that the total cost be minimized. We first show that if the cost function is decomposable, i.e., can be represented as the sum of two continuous functions defined on and , respectively, then every feasible measure is optimal....

Plug-in estimation of level sets in a non-compact setting with applications in multivariate risk theory

Elena Di Bernardino, Thomas Laloë, Véronique Maume-Deschamps, Clémentine Prieur (2013)

ESAIM: Probability and Statistics

Similarity:

This paper deals with the problem of estimating the level sets () =  {() ≥ }, with  ∈ (0,1), of an unknown distribution function on ℝ . A plug-in approach is followed. That is, given a consistent estimator of , we estimate () by () =  { () ≥ }. In our setting, non-compactness property is required for the level sets to estimate. We state consistency results with respect to the Hausdorff distance and the volume of the symmetric...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤    =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on 𝕋 d , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑    ...

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...

A note on a two dimensional knapsack problem with unloading constraints

Jefferson Luiz Moisés da Silveira, Eduardo Candido Xavier, Flávio Keidi Miyazawa (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

In this paper we address the two-dimensional knapsack problem with unloading constraints: we have a bin , and a list of rectangular items, each item with a class value in {1,...,}. The problem is to pack a subset of into , maximizing the total profit of packed items, where the packing must satisfy the unloading constraint: while removing one item , items with higher class values can not block . We present a (4 + )-approximation algorithm when the bin is a square. We also present (3 + )-approximation...