A feasible directions algorithm for optimal control problems with control and terminal inequality constraints

Abstract

Control constraints, because they are nondifferentiable in the space of control functions, are difficult to cope with in optimization algorithms not of the penalty function type. In feasible directions type algorithms a search direction is obtained by solving a subproblem which has a fixed constraint set S chosen a priori to make this subproblem simple to solve. In this paper control constraints are dealt with by using them to define, at the current control u , a constraint set S(u) for the search direction subproblem. This enables control constraints to be easily handled.