Efficient maximum likelihood estimation of copula based meta t-distributions
Recently an efficient fixed point algorithm, called maximization by parts (MBP), for finding maximum likelihood estimates has been applied to models based on Gaussian copulas. It requires a decomposition of a likelihood function into two parts and their iterative maximization by solving score equations. For the first time, the MBP algorithm is applied to multivariate meta t-distributions based on t-copulas. Since score equations for meta t-distributions do not have closed forms the proposed MBP algorithm in two variations maximizes the decomposed parts of the likelihood iteratively. Superiority of the proposed MBP algorithm over standard estimation methods such as inference for margins and direct maximization is illustrated in a simulation study. The usefulness of the proposed algorithm is shown in two data applications.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:55:y:2011:i:3:p:1196-1214. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.