A convex programming problem in Banach spaces and applications to optimum control theory

摘要

A convex programming problem for a functional defined on a Banach space issolved, and necessary conditions are derived in the form of a maximum principle. Applications of the results are made to minimum final (or initial) distance and to minimum-effort problems connected with a control process described by a linear evolution equation.