Displaying 61 – 80 of 143

Showing per page

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Exponential convergence for a convexifying equation

Guillaume Carlier, Alfred Galichon (2012)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an evolution equation similar to that introduced by Vese in [Comm. Partial Diff. Eq. 24 (1999) 1573–1591] and whose solution converges in large time to the convex envelope of the initial datum. We give a stochastic control representation for the solution from which we deduce, under quite general assumptions that the convergence in the Lipschitz norm is in fact exponential in time.

Hamilton-Jacobi-Bellman equations for the optimal control of a state equation with memory

Guillaume Carlier, Rabah Tahraoui (2010)

ESAIM: Control, Optimisation and Calculus of Variations

This article is devoted to the optimal control of state equations with memory of the form: x ˙ ( t ) = F ( x ( t ) , u ( t ) , 0 + A ( s ) x ( t - s ) d s ) , t > 0 , with initial conditions x ( 0 ) = x , x ( - s ) = z ( s ) , s > 0 . Denoting by y x , z , u the solution of the previous Cauchy problem and: v ( x , z ) : = inf u V { 0 + e - λ s L ( y x , z , u ( s ) , u ( s ) ) d s } where V is a class of admissible controls, we prove that v is the only viscosity solution of an Hamilton-Jacobi-Bellman equation of the form: λ v ( x , z ) + H ( x , z , x v ( x , z ) ) + D z v ( x , z ) , z ˙ = 0 in the sense of the theory of viscosity solutions in infinite-dimensions of Crandall and Lions.

Interior sphere property for level sets of the value function of an exit time problem

Marco Castelpietra (2009)

ESAIM: Control, Optimisation and Calculus of Variations

We consider an optimal control problem for a system of the form x ˙ = f(x,u), with a running cost L. We prove an interior sphere property for the level sets of the corresponding value function V. From such a property we obtain a semiconcavity result for V, as well as perimeter estimates for the attainable sets of a symmetric control system.

La aproximación geométrico-secuencial en los problemas de optimización dinámicos. I. El principio de máximo puntual.

Miguel Martín Dávila (1985)

Trabajos de Estadística e Investigación Operativa

En este artículo introducimos una nueva metodología para la generación de condiciones necesarias en problemas de optimización dinámicos.Denominamos a esta metodología la aproximación secuencial en contraposición a la aproximación puntual clásica y mostramos cómo obtener un principio de máximo puntual con este método.

Linearization techniques for See PDF -control problems and dynamic programming principles in classical and See PDF -control problems

Dan Goreac, Oana-Silvia Serea (2012)

ESAIM: Control, Optimisation and Calculus of Variations

The aim of the paper is to provide a linearization approach to the See PDF -control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating See PDF problems in continuous and lower semicontinuous setting.

Linearization techniques for 𝕃 See PDF-control problems and dynamic programming principles in classical and 𝕃 See PDF-control problems

Dan Goreac, Oana-Silvia Serea (2012)

ESAIM: Control, Optimisation and Calculus of Variations

The aim of the paper is to provide a linearization approach to the 𝕃 See PDF-control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the 𝕃 p See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating 𝕃 See PDF problems in continuous and lower semicontinuous...

Currently displaying 61 – 80 of 143