β Scribed by R. Conti
No coin nor oath required. For personal study only.
A convex programming problem for a functional defined on a Banach space is solved, 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.
π SIMILAR VOLUMES
## Introduction. The theory of discrete approximation serves as a framework of approximation and discretization methods for the numerical solution of functional equations. This theory allows a unified functional-analytic treatment of these methods. It was developed by several authors (see e.g. the
## Communicated by F. Clarke Abstract--We establish necessary and sufficient optimality conditions for quasi-convex programming. First, we treat some properties of the normal cone to the level set of a lower semicontinuous quasi-convex function defined on a Banach space. Next, we get our condition
## Abstract We study computability of the abstract linear Cauchy problem equation image where __A__ is a linear operator, possibly unbounded, on a Banach space __X__. We give necessary and sufficient conditions for __A__ such that the solution operator __K__: __x__ β¦ __u__ of the problem (1) is c