𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non convex control problems in Banach spaces

✍ Scribed by Ottavio Caligaris; Pietro Oliva

Publisher
Springer
Year
1979
Tongue
English
Weight
707 KB
Volume
5
Category
Article
ISSN
0095-4616

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Iterative approaches to convex feasibili
Iterative approaches to convex feasibility problems in Banach spaces
✍ John G. O’Hara; Paranjothi Pillay; Hong-Kun Xu πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 199 KB

The convex feasibility problem (CFP) of finding a point in the nonempty intersection N i=1 C i is considered, where N 1 is an integer and each C i is assumed to be the fixed point set of a nonexpansive mapping T i : X β†’ X with X a Banach space. It is shown that the iterative scheme x n+1 = n+1 y + (

A convex programming problem in Banach s
A convex programming problem in Banach spaces and applications to optimum control theory
✍ R. Conti πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 397 KB

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 desc