Name
Abstract | ||
|---|---|---|
In this paper, we derive a portfolio optimization model by minimizing upper and lower bounds of loss probability. These bounds are obtained under a nonparametric assumption of underlying return distribution by modifying the so-called generalization error bounds for the support vector machine, which has been developed in the field of statistical learning. Based on the bounds, two fractional programs are derived for constructing portfolios, where the numerator of the ratio in the objective includes the value-at-risk (VaR) or conditional value-at-risk (CVaR) while the denominator is any norm of portfolio vector. Depending on the parameter values in the model, the derived formulations can result in a nonconvex constrained optimization, and an algorithm for dealing with such a case is proposed. Some computational experiments are conducted on real stock market data, demonstrating that the CVaR-based fractional programming model outperforms the empirical probability minimization. (C) 2011 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ejor.2011.09.012 | European Journal of Operational Research |
Keywords | Field | DocType |
Finance,Portfolio optimization,CVaR (conditional value-at-risk),SVM (support vector machine),Fractional programming | Mathematical optimization,Upper and lower bounds,Nonparametric statistics,Empirical probability,Portfolio optimization,Mathematics,Fractional programming,No-arbitrage bounds,CVAR,Constrained optimization | Journal |
Volume | Issue | ISSN |
217 | 2 | 0377-2217 |
Citations | PageRank | References |
5 | 0.45 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun-Ya Gotoh | 1 | 117 | 10.17 |
| Akiko Takeda | 2 | 196 | 29.72 |