SOLVING LARGE SCALE MEAN-VARIANCE MODELS WITH DENSE NON-FACTORABLE COVARIANCE MATRICES
نویسندگان
چکیده
منابع مشابه
A Fast Algorithm for Solving Large Scale Mean-variance Models by Compact Factorization of Covariance Matrices
A fast al/lorithm for solving large scale MV (mean-variance) portfolio optimization problems is proposed. It is shown that by using T independent dat.a 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 const.raints and T quadratic terms in the objective function. As a result, the computation t.im...
متن کاملLarge-Scale Estimation of Variance and Covariance Components
This paper concerns matrix computations within algorithms for variance and covariance component estimation. Hemmerle and Hartley [Technometrics, 15 (1973), pp. 819-831 showed how to compute the objective function and its derivatives for maximum likelihood estimation of variance components using matrices with dimensions of the order of the number of coefficients rather than that of the number of...
متن کاملLarge Dynamic Covariance Matrices
Second moments of asset returns are important for risk management and portfolio selection. The problem of estimating second moments can be approached from two angles: time series and the cross-section. In time series, the key is to account for conditional heteroskedasticity; a favored model is Dynamic Conditional Correlation (DCC), derived from the ARCH/GARCH family started by Engle (1982). In ...
متن کاملEigenvalue variance bounds for covariance matrices
This work is concerned with finite range bounds on the variance of individual eigenvalues of random covariance matrices, both in the bulk and at the edge of the spectrum. In a preceding paper, the author established analogous results for Wigner matrices [7] and stated the results for covariance matrices. They are proved in the present paper. Relying on the LUE example, which needs to be investi...
متن کاملUnconstrained parametrizations for variance-covariance matrices
The estimation of variance-covariance matrices in situations that involve the optimization of an objective function (e.g. a log-likelihood function) is usually a difficult numerical problem, since the resulting estimates should be positive semi-definite matrices. We can either use constrained optimization, or employ a parameterization that enforces this condition. We describe here five differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2001
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.44.251