| Softcover ISBN: | 978-1-4704-2954-6 |
| Product Code: | MEMO/255/1220 |
| List Price: | $78.00 |
| MAA Member Price: | $70.20 |
| AMS Member Price: | $46.80 |
| Electronic ISBN: | 978-1-4704-4817-2 |
| Product Code: | MEMO/255/1220.E |
| List Price: | $78.00 |
| MAA Member Price: | $70.20 |
| AMS Member Price: | $46.80 |
-
Book DetailsMemoirs of the American Mathematical SocietyVolume: 255; 2018; 136 ppMSC: Primary 42; 26; 52; 35;
In a previous study, the authors built the Bellman function for integral functionals on the \(\mathrm{BMO}\) space. The present paper provides a development of the subject. They abandon the majority of unwanted restrictions on the function that generates the functional. It is the new evolutional approach that allows the authors to treat the problem in its natural setting. What is more, these new considerations lighten dynamical aspects of the Bellman function, in particular, the evolution of its picture.
-
Table of Contents
-
Chapters
-
1. Introduction
-
2. Setting and sketch of proof
-
3. Patterns for Bellman candidates
-
4. Evolution of Bellman candidates
-
5. Optimizers
-
6. Related questions and further development
-
-
Additional Material
-
RequestsReview Copy – for reviewers who would like to review an AMS bookPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Requests
In a previous study, the authors built the Bellman function for integral functionals on the \(\mathrm{BMO}\) space. The present paper provides a development of the subject. They abandon the majority of unwanted restrictions on the function that generates the functional. It is the new evolutional approach that allows the authors to treat the problem in its natural setting. What is more, these new considerations lighten dynamical aspects of the Bellman function, in particular, the evolution of its picture.
-
Chapters
-
1. Introduction
-
2. Setting and sketch of proof
-
3. Patterns for Bellman candidates
-
4. Evolution of Bellman candidates
-
5. Optimizers
-
6. Related questions and further development
