zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Dynamic programming and optimal control. Vol. 1. 3rd ed. (English) Zbl 1125.90056
Belmont, MA: Athena Scientific (ISBN 1-886529-26-4/hbk; 1-886529-08-6/set). xv, 543 p. $ 89.00; $ 119.50/set (2005).
This is the third edition of the text on dynamic programming and its applications. It introduces a large variety of ideas, facts, and algorithms for the general theory and applications. The latter include linear systems, inventory control, portfolio optimization, hypothesis testing, and many other applications. To avoid the use of measure theory and several mathematical complications, such as measurability and non-measurability of objective functions and the existence of measurable selectors, the ideas and methods are presented in a general form, but the presentation is rigorous mainly for the case of countable underlying probability spaces. The new edition contains a substantial amount of new material. In particular, new material on approximate dynamic programming was added and this topic became one of the principle focal points of the book. The major differences with the second edition of volume 1 include the following changes and additions: (a) A new section “Dynamic Programming and Minimax Control was added to Chapter 1 “The Dynamic Programming Algorithm.” The material of this section is connected with new material in Chapter 6 ”Suboptimal Control.” (b) The section on auction algorithms for shortest paths in Chapter 2 “Deterministic Systems and Shortest Path Problems” was eliminated. (c) The section “Constrained and Multiobjective Problems” was added to Chapter 2. (d) The material on sufficient statistics and partially observed Markov decision problems in Section 5.4 “Sufficient Statistics and Finite-State Markov Chains” was restructured and expanded. (e) Significant new material on approximate methods was added to Section 6. (f) New exercises were added.

90C39Dynamic programming
90-01Textbooks (optimization)
49L20Dynamic programming method (infinite-dimensional problems)
90C40Markov and semi-Markov decision processes
93E20Optimal stochastic control (systems)