中圖網小程序
一鍵登錄
更方便
本類五星書更多>
-
>
宇宙、量子和人類心靈
-
>
氣候文明史
-
>
南極100天
-
>
考研數學專題練1200題
-
>
希格斯:“上帝粒子”的發明與發現
-
>
神農架疊層石:10多億年前遠古海洋微生物建造的大堡礁
-
>
聲音簡史
抽象動態規劃(第2版) 版權信息
- ISBN：9787302599814
- 條形碼：9787302599814 ; 978-7-302-59981-4
- 裝幀：一般膠版紙
- 冊數：暫無
- 重量：暫無
- 所屬分類：>
抽象動態規劃(第2版) 本書特色
本書以動態規劃為基礎，運用抽象映射的單調性和壓縮映射理論研究近似動態規劃或動態規劃的若干典型問題，主要特點是：不涉及所討論問題的隨機特性，也不涉及特殊類型的動態規劃問題的某些有趣特征。本書中展示的理論方法位居隨機運籌學和隨機控制領域的學科前沿，其嚴謹的分析方法和處理技巧具有重要的理論價值，在數學與人工智能科學的交叉研究領域具有廣闊的應用前景。
抽象動態規劃(第2版) 內容簡介
第2版的主要目的是擴大第1版（2013）的第3章和第4章的半契約模型的內容，并以自第1版以來作者在期刊和報告中發表的研究成果作為補充。這本書的數學內容很好優雅且嚴格，依靠抽象的力量專注于基礎知識。該書搶先發售提供了該領域的全面綜合知識，同時提出了許多新研究，其中一些研究與當前很好活躍的領域（如近似動態編程）有關。本書中散布著許多例子，用嚴謹的理論統一起來，并將其應用于特定類型的問題，例如折扣、隨機*短路徑、半馬爾可夫、*小極大、序貫博弈、乘法和風險敏感模型。本書還包括練習（提供完整的解答），并通過示例、反例和理論擴展來補充本文。 就像Bertsekas的其他幾本著作一樣，這本書寫得很好，很好適合自學。它可用作研究生動態編程課程的補充。
抽象動態規劃(第2版) 目錄
1 Introduction
1．1 Structure ofDynamic Programming Problems
1．2 Abstract Dynamic Programming Models
1．2．1 Problem Formulation
1．2．2 Monotonicity and Contraction Properties
1．2．3 Some Examples
1．2．4 Approximation Models-Projected and Aggregation Bellman Equations
1．2．5 Multistep Models-Temporal Difference and ProximalAlgorithms
1．3 Organizationofthe Book
1．4 Notes， Sources， and Exercises
2 Contractive Models
2．1 Bellman's Equation and Optimality Conditions
2．2 Limited Lookahead Policies
2．3 Value Iteration
2．4 Policylteration
2．4．1 Approximate Policylteration
2．4．2 Approximate Policy Iteration Where Policies Converge
2．5 Optimistic Policylteration and A-Policylteration
2．5．1 Convergence ofOptimistic Policylteration
2．5．2 Approximate Optimistic Policylteration
2．5．3 Randomized Optimistic Policylteration
2．6 Asynchronous Algorithms
2．6．1 AsynchronousValuelteration
2．6．2 AsynchronousPolicylteration
2．6．3 Optimistic Asynchronous Policy Iteration with a Uniform Fixed Point
2．7 Notes， Sources， and Exercises
3 Semicontractive Models
3．1 Pathologies of Noncontractive DP Models
3．1．1 Deterministic Shortest Path Problems
3．1．2 Stochastic Shortest Path Problems
3．1．3 The Blackmailer's Dilemma
3．1．4 Linear-QuadraticProblems
3．1．5 An Intuitive View of Semicontractive Analysis
3．2 Semicontractive Models and Regular Policies
3．2．1 S-Regular Policies
3．2．2 Restricted Optimization over S-Regular Policies
3．2．3 Policy Iteration Analysis of Bellman's Equation
3．2．4 Optimistic Policy Iteration and A-Policy Iteration
3．2．5 A MathematicalProgrammingApproach
3．3 Irregular Policies/lnfinite Cost Case
3．4 Irregular Policies/Finite Cost Case-A Perturbation Approach
3．5 Applications in Shortest Path and Other Contexts
3．5．1 Stochastic Shortest Path Problems
3．5．2 Affine Monotonic Problems
3．5．3 Robust Shortest Path Planning
3．5．4 Linear-QuadraticOptimalControl
3．5．5 Continuous-State Deterministic Optimal Control
3．6 Algorithms
3．6．1 AsynchronousValuelteration
3．6．2 Asynchronous Policylteration
3．7 Notes， Sources， and Exercises
4 Noncontractive Models
4．1 Noncontractive Models-Problem Formulation
4．2 Finite Horizon Problems
4．3 Infinite Horizon Problems
4．3．1 Fixed Point Properties and Optimality Conditions
4．3．2 Value Iteration
4．3．3 Exact and Optimistic Policy Iteration-A-Policylteration
4．4 Regularity and Nonstationary Policies
4．4．1 Regularity and Monotonelncreasing Models
4．4．2 Nonnegative Cost Stochastic Optimal Control
4．4．3 Discounted Stochastic OptimalControl
4．4．4 Convergent Models
4．5 Stable Policies for Deterministic Optimal Control
……
Appendix A： Notation and Mathematical Conventions
Appendix B： Contraction Mappings．
References
Index．．
1．1 Structure ofDynamic Programming Problems
1．2 Abstract Dynamic Programming Models
1．2．1 Problem Formulation
1．2．2 Monotonicity and Contraction Properties
1．2．3 Some Examples
1．2．4 Approximation Models-Projected and Aggregation Bellman Equations
1．2．5 Multistep Models-Temporal Difference and ProximalAlgorithms
1．3 Organizationofthe Book
1．4 Notes， Sources， and Exercises
2 Contractive Models
2．1 Bellman's Equation and Optimality Conditions
2．2 Limited Lookahead Policies
2．3 Value Iteration
2．4 Policylteration
2．4．1 Approximate Policylteration
2．4．2 Approximate Policy Iteration Where Policies Converge
2．5 Optimistic Policylteration and A-Policylteration
2．5．1 Convergence ofOptimistic Policylteration
2．5．2 Approximate Optimistic Policylteration
2．5．3 Randomized Optimistic Policylteration
2．6 Asynchronous Algorithms
2．6．1 AsynchronousValuelteration
2．6．2 AsynchronousPolicylteration
2．6．3 Optimistic Asynchronous Policy Iteration with a Uniform Fixed Point
2．7 Notes， Sources， and Exercises
3 Semicontractive Models
3．1 Pathologies of Noncontractive DP Models
3．1．1 Deterministic Shortest Path Problems
3．1．2 Stochastic Shortest Path Problems
3．1．3 The Blackmailer's Dilemma
3．1．4 Linear-QuadraticProblems
3．1．5 An Intuitive View of Semicontractive Analysis
3．2 Semicontractive Models and Regular Policies
3．2．1 S-Regular Policies
3．2．2 Restricted Optimization over S-Regular Policies
3．2．3 Policy Iteration Analysis of Bellman's Equation
3．2．4 Optimistic Policy Iteration and A-Policy Iteration
3．2．5 A MathematicalProgrammingApproach
3．3 Irregular Policies/lnfinite Cost Case
3．4 Irregular Policies/Finite Cost Case-A Perturbation Approach
3．5 Applications in Shortest Path and Other Contexts
3．5．1 Stochastic Shortest Path Problems
3．5．2 Affine Monotonic Problems
3．5．3 Robust Shortest Path Planning
3．5．4 Linear-QuadraticOptimalControl
3．5．5 Continuous-State Deterministic Optimal Control
3．6 Algorithms
3．6．1 AsynchronousValuelteration
3．6．2 Asynchronous Policylteration
3．7 Notes， Sources， and Exercises
4 Noncontractive Models
4．1 Noncontractive Models-Problem Formulation
4．2 Finite Horizon Problems
4．3 Infinite Horizon Problems
4．3．1 Fixed Point Properties and Optimality Conditions
4．3．2 Value Iteration
4．3．3 Exact and Optimistic Policy Iteration-A-Policylteration
4．4 Regularity and Nonstationary Policies
4．4．1 Regularity and Monotonelncreasing Models
4．4．2 Nonnegative Cost Stochastic Optimal Control
4．4．3 Discounted Stochastic OptimalControl
4．4．4 Convergent Models
4．5 Stable Policies for Deterministic Optimal Control
……
Appendix A： Notation and Mathematical Conventions
Appendix B： Contraction Mappings．
References
Index．．
展開全部
抽象動態規劃(第2版) 作者簡介
德梅萃 P.博塞克斯（Dimitri P. Bertseka）,美國MIT終身教授，美國國家工程院院士，清華大學復雜與網絡化系統研究中心客座教授。電氣工程與計算機科學領域國際知名作者，著有《非線性規劃》《網絡優化》《凸優化》等十幾本暢銷教材和專著。
書友推薦
- >
經典常談
- >
人文閱讀與收藏·良友文學叢書:一天的工作
- >
伊索寓言-世界文學名著典藏-全譯本
- >
我從未如此眷戀人間
- >
唐代進士錄
- >
羅曼·羅蘭讀書隨筆-精裝
- >
自卑與超越
- >
有舍有得是人生
本類暢銷
