1 / 24

V.A. Babaitsev, A.V. Brailov, V.Y. Popov

V.A. Babaitsev, A.V. Brailov, V.Y. Popov. On Niedermayers' algorithm of efficient frontier computing. Two Internet papers with common title “ Applying Markowitz's Critical Line Algorithm ” have appeared in 2006-2007. Two young Suiss economists Andras and Daniel Niedermayer

badu
Download Presentation

V.A. Babaitsev, A.V. Brailov, V.Y. Popov

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. V.A. Babaitsev, A.V. Brailov, V.Y. Popov On Niedermayers' algorithm of efficient frontier computing

  2. Two Internet papers with common title “Applying Markowitz's Critical Line Algorithm” have appeared in 2006-2007. Two young Suiss economists Andras and DanielNiedermayer presented fast algorithm of getting efficient frontier for Markowitz portfolio problem. http://www.vwl.unibe.ch/papers/dp/dp0602.pdf Springer Verlag will publish soon (November) a book “Handbook of Portfolio Construction. Contemporary Applications of Markowitz Techniques” with this paper .

  3. Markowitz problem Notations • n assets; • V– an (n×n)positive definite covariance matrix; • μ– n vector of assets expected returns; • X – n vector of assets weights; • 1– n unitvector: • μ– portfolio expected return; • D – variance, σ– standard deviation (risk).

  4. Some assumptions 1. Assets are ordered by increasing of expected returns, more over Minimal frontier in coordinates consists of finite number of parabola divided by turning points. 2. Moving along minimal border from left to right over turning point only one asset added or removed to (from) portfolio.

  5. Niedermayers’ algorithm 1. Start from turning point with initial portfolio . 2. When moving from a turning point to the next higher one two situations must occur: either one non-zero asset becomes zero or a formerly zero asset becomes non-zero. Algorithm considers both situations and chooses case with minimum possible derivative value. 3. Algorithm ends when reaching final turning point and final portfolio .

  6. Performance We have checked algorithm performance. Prof. Victor Popov has developed the program in C++ for this algorithm. Prof. Andrey Brailov has used his own developedprogram envelope MatCalc (miniMATLAB). For 201 assets execution time was 1 sec. (Pentium 4, 2.66 GHz, 256 Mb)

  7. Minimal frontier for 201 assets ■ Turning points

  8. Counterexample Condition 2 is not true generally. Example: Solution:

  9. Example plot • Green line – minimal frontier • Light red – • Red – • have common tangent point σ μ

  10. Example for n = 4 Left end: is positively defined. Adjacent turning points and

  11. Generalization We can construct similar examples for larger value of n. Adjacent turning points will be P(0, 0, …, 0, 1) and , where It is sufficient to choose matrix V with conditions: which provides common tangent point for minimal frontiers: Good news: set of Markowitz problems with the satisfied condition 2 is dense in set of all such problems.

  12. Some basic formulas For two adjacent turning points equation of minimal frontier is where S– subset of {1, 2, …, n} non-zero assets.

  13. Geometry of minimal frontier Lemma. Two parabolas with equations have common tangent point if and only if First condition of lemma is true when expanding the frontier one asset, second condition is not satisfied generally.

  14. Example Citation from A.D. Ukhov “Expanding the frontier one asset at a time”, Finance Research Letters, 3 (2006), 194-206: “It is well-known property of the portfolio problem that for each asset there is one minimum-variance portfolio in which it has a weight zero. Therefore, on the frontier constructed with (n + 1) assets there will be one point that has a weight of zero for the new asset.” Example.

  15. Example (continued) Vector has a constant second component. – green line. – red line. σ μ

  16. Three parabolas lemma y P x

  17. Three parabolas lemma Two parabolas with equations: intersect in point P. Third parabola has common tangent points with Let Then coefficients of third parabola will be: As consequence and if

  18. Quality of minimal frontier Resampling technique was originally proposed by R.Michaud and R.Michaud in 1998. It requires: • collecting T historical returns on a set of Z assets; • computing sample means and covariance matrix ; • finding a set of K optimal portfolios for every value of • simulating N independent draws for asset returns from multivariate normal distribution with mean and variance matrix equal to sample ones; • for each simulation re-estimating a new set of optimization input and V and finding new set of K optimal portfolios.

  19. From “Implementing Models in Quantitative Finance” Fusai, Gianluca, Roncoroni, Andrea: Springer Finance2008, p. 277

  20. MICEX Example MICEX is Russian stock market. We choose 9 top assets and use monthly returns for 5 years (2004-2008). Then input data for Markowitz problem were calculated. After analyzing of covariance matrix we have reduced number of assets to 6 because 3 assets were not included in any portfolio.

  21. Results • 10 turning points are on minimal frontier. • Coefficients of parabolas are decreasing with increasing of number of assets. Minimal coefficients are for maximum number of assets - 6. Statistical stability is predicted for minimal coefficients.

  22. Concluding remark

  23. Markowitz vs. Index return time Blue – MICEX Index Green – Markowitz portflio

More Related