The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The aim of the paper is to provide a linearization approach to the -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 approach and the associated linear formulations. This seems to be the most appropriate tool for treating problems in continuous and lower semicontinuous setting.
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...
On a closed convex set in with sufficiently smooth () boundary, the stop operator is locally Lipschitz continuous from into . The smoothness of the boundary is essential: A counterexample shows that -smoothness is not sufficient.
In the paper we consider lower semicontinuous differential inclusions with one sided Lipschitz and compact valued right hand side in a Banach space with uniformly convex dual. We examine the nonemptiness and some qualitative properties of the solution set.
Some properties of differential inclusions with lower semicontinuous right-hand side are considered. Our essential assumption is the one-sided Lipschitz condition introduced in [4]. Using the main idea of [10], we extend the well known relaxation theorem, stating that the solution set of the original problem is dense in the solution set of the relaxed one, under assumptions essentially weaker than those in the literature. Applications in optimal control are given.
Currently displaying 1 –
6 of
6