A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES

  • Konno H
  • Suzuki K
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A fast algorithm for solving large scale MV (mean-variance) portfolio optimization problems is proposed. It is shown that by using T independent data representing the rate of return of the assets, the MV model consisting of n assets can be put into a quadratic program with n + T variables, T linear Constraints and T quadratic terms in the objective function. As a result, the computation time required to solve this problem would increase very mildly as a function of n. This implies that a very large scale MV model can now be solved in a practical amount of time.

Cite

CITATION STYLE

APA

Konno, H., & Suzuki, K. (1992). A FAST ALGORITHM FOR SOLVING LARGE SCALE MEAN-VARIANCE MODELS BY COMPACT FACTORIZATION OF COVARIANCE MATRICES. Journal of the Operations Research Society of Japan, 35(1), 93–104. https://doi.org/10.15807/jorsj.35.93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free