Dynamic Programming And Optimal Control : (Record no. 2546)

MARC details
000 -LEADER
fixed length control field 03747nam a22002417a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20251126172514.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 180327b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 978-1886529441
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 519.703
Item number BerD4 Vol.2
100 ## - MAIN ENTRY--AUTHOR NAME
Personal name Bertsekas, Dimitri P.
245 ## - TITLE STATEMENT
Title Dynamic Programming And Optimal Control :
Remainder of title Approximate Dynamic Programming [4th ed.] [Vol.2] /
Statement of responsibility, etc Dimitri P. Bertsekas
250 ## - EDITION STATEMENT
Edition statement 4th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication USA:
Name of publisher Athena Scientific;
Year of publication ©2012
300 ## - PHYSICAL DESCRIPTION
Number of Pages 694p.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note Contents: 1. Discounted Problems - Theory. 2. Discounted Problems - Computational Methods. 3.<br/>Stochastic Shortest Path Problems. 4. Undiscounted Problems. 5. Average Cost per Stage Problems. 6. Approximate Dynamic Programming - Discounted Models. 7. Approximate Dynamic Programming - Nondiscounted Models and Generalizations.
520 ## - SUMMARY, ETC.
Summary, etc This 4th edition is a major revision of Vol. II of the leading two-volume dynamic programming textbook by Bertsekas, and contains a substantial amount of new material, as well as<br/>a reorganization of old material. The length has increased by more than 60% from the third edition, and<br/>most of the old material has been restructured and/or revised. Volume II now numbers more than 700 pages and is larger in size than Vol. I. It can arguably be viewed as a new book!<br/><br/>Approximate DP has become the central focal point of Vol. II, and occupies more than half of the book (the last two chapters, and large parts of Chapters 1-3). Thus one may also view Vol. II as a followup of the author's 1996 book ``Neuro-Dynamic Programming" (coauthored with John Tsitsiklis). The present book focuses to a great extent<br/>on new research that became available after 1996. On the other hand, the textbook style of the book has been preserved, and some material has been explained at an intuitive or informal level, while referring to the journal literature or the Neuro-Dynamic Programming book for a more mathematical treatment.<br/><br/>As the book's focus shifted, increased emphasis was placed on new or recent research in approximate DP and simulation-based methods, as well as on asynchronous iterative methods, in view of the central role of simulation, which is by nature asynchronous. A lot of this material is an outgrowth of research conducted in the six years since the previous edition. Some of the highlights, in the order appearing in the book, are:<br/>(a) A broad spectrum of simulation-based, approximate value iteration, policy iteration, and Q-learning methods based on projected equations and aggregation.<br/>(b) New policy iteration and Q-learning algorithms for stochastic shortest path problems with improper policies.<br/>(c) Reliable Q-learning algorithms for optimistic policy iteration.<br/>(d) New simulation techniques for multistep methods, such as geometric and free-form sampling, based on generalized weighted Bellman equations.<br/>(e) Computational methods for generalized/abstract discounted DP, including convergence analysis and error bounds for approximations.<br/>(f) Monte Carlo linear algebra methods, which extend the approximate DP methodology to broadly applicable problems involving large-scale regression and systems of linear equations.<br/><br/>The book includes a substantial number of examples, and exercises, detailed solutions of many of which are posted on the internet. It was developed through teaching graduate courses at M.I.T., and is supported by a large amount of educational material, such as slides and videos, posted at the MIT Open Courseware, the author's, and the publisher's web sites.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Dynamic Programming
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Approximate Dynamic Programming
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Control Theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Optimization Techniques
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
Holdings
Withdrawn status Lost status Damaged status Collection code Home library Current library Shelving location Date acquired Source of acquisition Purchase Price Bill number Full call number Accession Number Print Price Bill Date/Price effective from Koha item type
      Computer Science Indian Institute of Technology Tirupati Indian Institute of Technology Tirupati General Stacks 27/03/2018 The Book Syndicate 3821.94 BS/35705 519.703 DIM 04421 4496.40 10/03/2018 Books
      Computer Science Indian Institute of Technology Tirupati Indian Institute of Technology Tirupati General Stacks 27/03/2018 The Book Syndicate 3821.94 BS/35705 519.703 DIM 04422 4496.40 10/03/2018 Books