Fast Markowitz’s critical line algorithm

The mean-variance portfolio analysis pioneered by Nobel Prize winner H. Markowitz (1990) lies at the foundation of the modern portfolio theory. The method and the resulting set of efficient portfolios display notable robustness and continue to attract researchers. In recent years, Monte Carlo methods used for portfolio resampling to get statistically stable portfolios. These methods repeatedly employ quadratic optimization algorithms and, therefore, require a fast implementation of the mean variance optimizer.
Andras Niedermayer and Daniel Niedermayer have developed recently fast algorithm of the kind which significantly outperforms all known software packages. We apply Critical Line Algorithm to obtain algorithm faster than Niedermayers’variant at least two times. It needs more thoroughly investigation of Markowitz’s problem.