語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Approximate Dynamic Programming for ...
~
Desai, Vijay V.
FindBook
Google Book
Amazon
博客來
Approximate Dynamic Programming for Large Scale Systems.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Approximate Dynamic Programming for Large Scale Systems./
作者:
Desai, Vijay V.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2012,
面頁冊數:
154 p.
附註:
Source: Dissertation Abstracts International, Volume: 73-05, Section: B, page: 3243.
Contained By:
Dissertation Abstracts International73-05B.
標題:
Operations research. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3490808
ISBN:
9781267120243
Approximate Dynamic Programming for Large Scale Systems.
Desai, Vijay V.
Approximate Dynamic Programming for Large Scale Systems.
- Ann Arbor : ProQuest Dissertations & Theses, 2012 - 154 p.
Source: Dissertation Abstracts International, Volume: 73-05, Section: B, page: 3243.
Thesis (Ph.D.)--Columbia University, 2012.
This item is not available from ProQuest Dissertations & Theses.
Sequential decision making under uncertainty is at the heart of a wide variety of practical problems. These problems can be cast as dynamic programs and the optimal value function can be computed by solving Bellman's equation. However, this approach is limited in its applicability. As the number of state variables increases, the state space size grows exponentially, a phenomenon known as the curse of dimensionality, rendering the standard dynamic programming approach impractical.
ISBN: 9781267120243Subjects--Topical Terms:
547123
Operations research.
Approximate Dynamic Programming for Large Scale Systems.
LDR
:04474nmm a2200349 4500
001
2125630
005
20171113102614.5
008
180830s2012 ||||||||||||||||| ||eng d
020
$a
9781267120243
035
$a
(MiAaPQ)AAI3490808
035
$a
AAI3490808
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Desai, Vijay V.
$3
3287713
245
1 0
$a
Approximate Dynamic Programming for Large Scale Systems.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2012
300
$a
154 p.
500
$a
Source: Dissertation Abstracts International, Volume: 73-05, Section: B, page: 3243.
500
$a
Adviser: Ciamac C. Moallemi.
502
$a
Thesis (Ph.D.)--Columbia University, 2012.
506
$a
This item is not available from ProQuest Dissertations & Theses.
520
$a
Sequential decision making under uncertainty is at the heart of a wide variety of practical problems. These problems can be cast as dynamic programs and the optimal value function can be computed by solving Bellman's equation. However, this approach is limited in its applicability. As the number of state variables increases, the state space size grows exponentially, a phenomenon known as the curse of dimensionality, rendering the standard dynamic programming approach impractical.
520
$a
An effective way of addressing curse of dimensionality is through parameterized value function approximation. Such an approximation is determined by relatively small number of parameters and serves as an estimate of the optimal value function. But in order for this approach to be effective, we need Approximate Dynamic Programming (ADP) algorithms that can deliver 'good' approximation to the optimal value function and such an approximation can then be used to derive policies for effective decision-making. From a practical standpoint, in order to assess the effectiveness of such an approximation, there is also a need for methods that give a sense for the suboptimality of a policy. This thesis is an attempt to address both these issues.
520
$a
First, we introduce a new ADP algorithm based on linear programming, to compute value function approximations. LP approaches to approximate DP have typically relied on a natural 'projection' of a well studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go function. Our program -- the 'smoothed approximate linear program' -- is distinct from such approaches and relaxes the restriction to lower bounding approximations in an appropriate fashion while remaining computationally tractable. The resulting program enjoys strong approximation guarantees and is shown to perform well in numerical experiments with the game of Tetris and queueing network control problem.
520
$a
Next, we consider optimal stopping problems with applications to pricing of high-dimensional American options. We introduce the pathwise optimization (PO) method: a new convex optimization procedure to produce upper and lower bounds on the optimal value (the 'price') of high-dimensional optimal stopping problems. The PO method builds on a dual characterization of optimal stopping problems as optimization problems over the space of martingales, which we dub the martingale duality approach. We demonstrate via numerical experiments that the PO method produces upper bounds and lower bounds (via suboptimal exercise policies) of a quality comparable with state-of-the-art approaches. Further, we develop an approximation theory relevant to martingale duality approaches in general and the PO method in particular.
520
$a
Finally, we consider a broad class of MDPs and introduce a new tractable method for computing bounds by consider information relaxation and introducing penalty. The method delivers tight bounds by identifying the best penalty function among a parameterized class of penalty functions. We implement our method on a high-dimensional financial application, namely, optimal execution and demonstrate the practical value of the method vis-a-vis competing methods available in the literature. In addition, we provide theory to show that bounds generated by our method are provably tighter than some of the other available approaches.
590
$a
School code: 0054.
650
4
$a
Operations research.
$3
547123
650
4
$a
Applied mathematics.
$3
2122814
690
$a
0796
690
$a
0364
710
2
$a
Columbia University.
$b
Operations Research.
$3
2096452
773
0
$t
Dissertation Abstracts International
$g
73-05B.
790
$a
0054
791
$a
Ph.D.
792
$a
2012
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3490808
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9336242
電子資源
01.外借(書)_YB
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入