Discrete approximation in quantile problem of portfolio selection

被引：0

作者：

Kibzun, A ^{[1
]}

Lepp, R ^{[1
]}

机构：

[1] Moscow Inst Aviat Technol, Dept Probabil Theory, Moscow 125871, Russia

来源：

STOCHASTIC OPTIMIZATION: ALGORITHMS AND APPLICATIONS | 2001年 / 54卷

关键词：

portfolio selection; stochastic programming; quantile criterion; value-at-risk; confidence method; discrete approximation; logarithmic strategy; risky strategy; confidence strategy;

D O I：

暂无

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

The paper deals with the well-known problem concerning the optimal investment. A paradoxical situation which is caused by the choice of the expected return as an optimization criterion is discussed. The quantile problem of the portfolio selection is investigated. Two algorithms based on the confidence method and discrete approximation of the probability measure axe suggested for solution of the quantile problem. Several different algorithms for solving the portfolio optimization problem are compared in an example.

引用

页码：121 / 135

页数：15

共 15 条

[1] BERTSEKAS D. P, 1978, Neuro-dynamic programming
[2] Portfolio optimization via stochastic programming:: Methods of output analysis
Dupacová, J
[J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1999, 50 (02) : 245 - 270
[3] A STOCHASTIC-PROGRAMMING MODEL
KATAOKA, S
[J]. ECONOMETRICA, 1963, 31 (1-2) : 181 - 196
[4] A NEW INTERPRETATION OF INFORMATION RATE
KELLY, JL
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (04): : 917 - 926
[5] Kibzun A. I., 1991, Annals of Operations Research, V30, P81, DOI 10.1007/BF02204810
[6] Kibzun A.I., 1996, STOCHASTIC PROGRAMMI
[7] KIBZUN AI, 1986, SOV J COMPUT SYST S+, V24, P69
[8] PROJECTION AND DISCRETIZATION METHODS IN STOCHASTIC-PROGRAMMING
LEPP, R
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1994, 56 (1-2) : 55 - 64
[9] MOESEKE P, 1980, STOCHASTIC PROGRAMMI, P497
[10] Polyak B. T., 1987, INTRO OPTIMIZATION

← 1 2 →