Page 1 Next

Displaying 1 – 20 of 61

Showing per page

The Euler Lagrange Equation and the Pontriagin Maximum Principle

Arrigo Cellina (2005)

Bollettino dell'Unione Matematica Italiana

We consider the necessary conditions in the Calculus of Variations, expressed by the validity of the Euler Lagrange equation, or of the Pontriagin Maximum Principle; in particular, problems on multi-dimensional domanis are considered.

The H–1-norm of tubular neighbourhoods of curves

Yves van Gennip, Mark A. Peletier (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We study the H–1-norm of the function 1 on tubular neighbourhoods of curves in 2 . We take the limit of small thicknessε, and we prove two different asymptotic results. The first is an asymptotic development for a fixed curve in the limit ε → 0, containing contributions from the length of the curve (at order ε3), the ends (ε4), and the curvature (ε5). The second result is a Γ-convergence result, in which the central curve may vary along the sequence ε → 0. We prove that a rescaled version of the...

The H–1-norm of tubular neighbourhoods of curves

Yves van Gennip, Mark A. Peletier (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We study the H–1-norm of the function 1 on tubular neighbourhoods of curves in 2 . We take the limit of small thickness ε, and we prove two different asymptotic results. The first is an asymptotic development for a fixed curve in the limit ε → 0, containing contributions from the length of the curve (at order ε3), the ends (ε4), and the curvature (ε5). The second result is a Γ-convergence result, in which the central curve may vary along the sequence ε → 0. We prove that a rescaled version of...

The Lazy Travelling Salesman Problem in 2

Paz Polak, Gershon Wolansky (2007)

ESAIM: Control, Optimisation and Calculus of Variations

We study a parameter (σ) dependent relaxation of the Travelling Salesman Problem on  2 . The relaxed problem is reduced to the Travelling Salesman Problem as σ 0. For increasing σ it is also an ordered clustering algorithm for a set of points in 2 . A dual formulation is introduced, which reduces the problem to a convex optimization, provided the minimizer is in the domain of convexity of the relaxed functional. It is shown that this last condition is generically satisfied, provided σ is large enough. ...

The Monge problem for strictly convex norms in d

Thierry Champion, Luigi De Pascale (2010)

Journal of the European Mathematical Society

We prove the existence of an optimal transport map for the Monge problem in a convex bounded subset of d under the assumptions that the first marginal is absolutely continuous with respect to the Lebesgue measure and that the cost is given by a strictly convex norm. We propose a new approach which does not use disintegration of measures.

The optimization of the stationary heat equation with a variable right-hand side

Ctirad Matyska (1986)

Aplikace matematiky

Solving the stationary heat equation we optimize the temperature on part of the boundary of the domain under investigation. First the Poisson equation is solved; both the Neumann condition on part of the boundary and the Newton condition on the rest are prescribed, the distribution of the heat sources being variable. In the second case, the heat equation also contains a convective term, the distribution of heat sources is specified and the Neumann condition is variable on part of the boundary.

Currently displaying 1 – 20 of 61

Page 1 Next