Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Dynamic portfolio management: An app...
~
Han, Jiarui.
Dynamic portfolio management: An approximate linear programming approach.
Record Type:
Electronic resources : Monograph/item
Title/Author:
Dynamic portfolio management: An approximate linear programming approach.
Author:
Han, Jiarui.
Description:
69 p.
Notes:
Advisers: Tze Leung Lai; Benjamin Van Roy.
Notes:
Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4304.
Contained By:
Dissertation Abstracts International66-08B.
Subject:
Statistics.
Online resource:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186347
ISBN:
9780542285929
Dynamic portfolio management: An approximate linear programming approach.
Han, Jiarui.
Dynamic portfolio management: An approximate linear programming approach.
- 69 p.
Advisers: Tze Leung Lai; Benjamin Van Roy.
Thesis (Ph.D.)--Stanford University, 2005.
Portfolio management is one of the central subjects of modern finance. However, in most cases it is difficult to determine optimal strategies for intertemporal portfolio management problems. In this thesis, we formulate a class of intertemporal portfolio management problems in the continuous-time framework, and offer a new computational approach, which we call approximate linear programming, to this class of portfolio problems. We start by deriving the corresponding Hamilton-Jacobi-Bellman equation, and transform it into an equivalent linear program. Since this equivalent linear program is intractable due to an infinite number of constraints, we use basis function approximations and constraint-sampling techniques to obtain a tractable approximating linear program. Finally we present efficient algorithms to solve the approximate linear program. Our approximate linear programming approach has four major features: it scales well with dimensions; it has a priori performance bounds; it can deal with both complete and incomplete markets; and it provides an approximate upper bound on the optimal value. We also present case studies to demonstrate the effectiveness of our algorithm, particularly for large portfolios as illustrated in a 10-dimensional problem.
ISBN: 9780542285929Subjects--Topical Terms:
182057
Statistics.
Dynamic portfolio management: An approximate linear programming approach.
LDR
:02280nmm _2200277 _450
001
170768
005
20061228142240.5
008
090528s2005 eng d
020
$a
9780542285929
035
$a
00242798
040
$a
UnM
$c
UnM
100
0
$a
Han, Jiarui.
$3
244798
245
1 0
$a
Dynamic portfolio management: An approximate linear programming approach.
300
$a
69 p.
500
$a
Advisers: Tze Leung Lai; Benjamin Van Roy.
500
$a
Source: Dissertation Abstracts International, Volume: 66-08, Section: B, page: 4304.
502
$a
Thesis (Ph.D.)--Stanford University, 2005.
520
#
$a
Portfolio management is one of the central subjects of modern finance. However, in most cases it is difficult to determine optimal strategies for intertemporal portfolio management problems. In this thesis, we formulate a class of intertemporal portfolio management problems in the continuous-time framework, and offer a new computational approach, which we call approximate linear programming, to this class of portfolio problems. We start by deriving the corresponding Hamilton-Jacobi-Bellman equation, and transform it into an equivalent linear program. Since this equivalent linear program is intractable due to an infinite number of constraints, we use basis function approximations and constraint-sampling techniques to obtain a tractable approximating linear program. Finally we present efficient algorithms to solve the approximate linear program. Our approximate linear programming approach has four major features: it scales well with dimensions; it has a priori performance bounds; it can deal with both complete and incomplete markets; and it provides an approximate upper bound on the optimal value. We also present case studies to demonstrate the effectiveness of our algorithm, particularly for large portfolios as illustrated in a 10-dimensional problem.
590
$a
School code: 0212.
650
# 0
$a
Statistics.
$3
182057
650
# 0
$a
Operations Research.
$3
227148
690
$a
0463
690
$a
0796
710
0 #
$a
Stanford University.
$3
212607
773
0 #
$g
66-08B.
$t
Dissertation Abstracts International
790
$a
0212
790
1 0
$a
Lai, Tze Leung,
$e
advisor
790
1 0
$a
Van Roy, Benjamin,
$e
advisor
791
$a
Ph.D.
792
$a
2005
856
4 0
$u
http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186347
$z
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186347
based on 0 review(s)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000002566
電子館藏
1圖書
學位論文
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3186347
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login