This paper studies first–order differentiability properties of the value function in concave dynamic programs. Motivated by economic considerations, we dispense with commonly imposed interiority assumptions. We suppose that the correspondence of feasible choices varies with the vector of state...

This paper studies first-order differentiability properties of the value function in concave dynamic programs. Motivated by economic considerations, we dispense with commonly imposed interiority assumptions. We suppose that the correspondence of feasible choices varies with the vector of state...

In this paper we present a multi-start particle swarm optimization algorithm for the global optimization of a function subject to bound constraints. The procedure consists of three main steps. In the initialization phase, an opposition learning strategy is performed to improve the search...

We discuss conditions for the Aubin property of solutions to perturbed cone constrained programs, by using and refining results given in Klatte and Kummer (Nonsmooth equations in optimization. Kluwer, Dordrecht, 2002 ). In particular, we show that constraint nondegeneracy and hence uniqueness of...