Mean-Absolute Deviation Portfolio Optimization Model and Its Applications to Tokyo Stock Market
Модель портфельной оптимизации на основе среднеабсолютного отклонения и её применения к Токийскому фондовому рынку
1991-05-01
SCID: 54.1/8chrkhya
Discuss with AI
L1 riskNIKKEI 225linear programmingmean absolute deviationportfolio optimization
Figures from the paper
Abstract (AI)
The purpose of this paper is to demonstrate that a portfolio optimization model using the L 1 risk (mean absolute deviation risk) function can remove most of the difficulties associated with the classical Markowitz's model while maintaining its advantages over equilibrium models. In particular, the L 1 risk model leads to a linear program instead of a quadratic program, so that a large-scale optimization problem consisting of more than 1,000 stocks may be solved on a real time basis. Numerical experiments using the historical data of NIKKEI 225 stocks show that the L 1 risk model generates a portfolio quite similar to that of the Markowitz's model within a fraction of time required to solve the latter.
Key Findings
1
Numerical experiments on historical NIKKEI 225 data show the L1 risk model produces portfolios quite similar to Markowitz portfolios.
2
The L1 model achieves similar portfolio results to Markowitz within a fraction of the computation time required by the quadratic formulation.
3
The L1 model can solve large-scale optimization problems (over 1,000 stocks) in real time.
4
The L1 risk portfolio optimization becomes a linear program instead of a quadratic program, enabling much faster solution times.
5
Using mean absolute deviation (L1) as the risk measure removes many difficulties of the classical Markowitz model while preserving its advantages over equilibrium models.
Research Object
Portfolio optimization model using L1 (mean absolute deviation) risk applied to stock portfolios (NIKKEI 225 / Tokyo stock market)
Research Subject
Ability of the L1 mean-absolute deviation risk model to replicate Markowitz portfolio results while reducing computational difficulty (linear vs quadratic programming) and enabling large-scale, real-time optimization
Publication Details
Publication Date
1991-05-01
Journal
Publisher
ISSN
Access Type
Author Information
Download PDF
Subscribe to digest