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
โฆ LIBER โฆ
Tackling inverse problems in a Banach space environment: from theory to applications
โ Scribed by Schuster, Thomas; Hofmann, Bernd; Kaltenbacher, Barbara
- Book ID
- 118247158
- Publisher
- Institute of Physics
- Year
- 2012
- Tongue
- English
- Weight
- 895 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0266-5611
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A convex programming problem in Banach s
โ
R. Conti
๐
Article
๐
1970
๐
Elsevier Science
๐
English
โ 397 KB
A Problem in Discretization Theory Relat
โ
S. Heinrich
๐
Article
๐
1983
๐
John Wiley and Sons
๐
English
โ 320 KB
๐ 1 views
## 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
A new differential calculus on a complex
โ
C. S. Sharma; I. Rebelo
๐
Article
๐
1975
๐
Springer
๐
English
โ 886 KB
A nonlinear equation in Banach spaces an
โ
P. Braz e Silva; L. Ferreira; M. Loayza
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 473 KB
The uniqueness of a solution to the inve
โ
Kokurin, M. M.
๐
Article
๐
2013
๐
Allerton Press, Inc.
๐
English
โ 604 KB
On a characterization of operators from
โ
Bernd Carl
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 476 KB