Previous Page 3

Displaying 41 – 58 of 58

Showing per page

An extragradient iterative scheme by viscosity approximation methods for fixed point problems and variational inequality problems

Adrian Petruşel, Jen-Chih Yao (2009)

Open Mathematics

In this paper, we introduce a new iterative process for finding the common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality problem for an α-inverse-strongly-monotone, by combining an modified extragradient scheme with the viscosity approximation method. We prove a strong convergence theorem for the sequences generated by this new iterative process.

An idempotent algorithm for a class of network-disruption games

William M. McEneaney, Amit Pandey (2016)

Kybernetika

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...

Analysis of Hamilton-Jacobi-Bellman equations arising in stochastic singular control

Ryan Hynd (2013)

ESAIM: Control, Optimisation and Calculus of Variations

We study the partial differential equation         max{Lu − f, H(Du)} = 0 where u is the unknown function, L is a second-order elliptic operator, f is a given smooth function and H is a convex function. This is a model equation for Hamilton-Jacobi-Bellman equations arising in stochastic singular control. We establish the existence of a unique viscosity solution of the Dirichlet problem that has a Hölder continuous gradient. We also show that if H is uniformly convex, the gradient of this solution...

Approximation of control problems involving ordinary and impulsive controls

Fabio Camilli, Maurizio Falcone (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In this paper we study an approximation scheme for a class of control problems involving an ordinary control v, an impulsive control u and its derivative u ˙ . Adopting a space-time reparametrization of the problem which adds one variable to the state space we overcome some difficulties connected to the presence of u ˙ . We construct an approximation scheme for that augmented system, prove that it converges to the value function of the augmented problem and establish an error estimates in L∞ for this approximation....

Approximation of solutions of Hamilton-Jacobi equations on the Heisenberg group

Yves Achdou, Italo Capuzzo-Dolcetta (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

We propose and analyze numerical schemes for viscosity solutions of time-dependent Hamilton-Jacobi equations on the Heisenberg group. The main idea is to construct a grid compatible with the noncommutative group geometry. Under suitable assumptions on the data, the Hamiltonian and the parameters for the discrete first order scheme, we prove that the error between the viscosity solution computed at the grid nodes and the solution of the discrete problem behaves like h where h is the mesh step. Such...

Approximation of the pareto optimal set for multiobjective optimal control problems using viability kernels

Alexis Guigue (2014)

ESAIM: Control, Optimisation and Calculus of Variations

This paper provides a convergent numerical approximation of the Pareto optimal set for finite-horizon multiobjective optimal control problems in which the objective space is not necessarily convex. Our approach is based on Viability Theory. We first introduce a set-valued return function V and show that the epigraph of V equals the viability kernel of a certain related augmented dynamical system. We then introduce an approximate set-valued return function with finite set-values as the solution of...

Approximation of the Snell envelope and american options prices in dimension one

Vlad Bally, Bruno Saussereau (2002)

ESAIM: Probability and Statistics

We establish some error estimates for the approximation of an optimal stopping problem along the paths of the Black–Scholes model. This approximation is based on a tree method. Moreover, we give a global approximation result for the related obstacle problem.

Approximation of the Snell Envelope and American Options Prices in dimension one

Vlad Bally, Bruno Saussereau (2010)

ESAIM: Probability and Statistics

We establish some error estimates for the approximation of an optimal stopping problem along the paths of the Black–Scholes model. This approximation is based on a tree method. Moreover, we give a global approximation result for the related obstacle problem.

Currently displaying 41 – 58 of 58

Previous Page 3