Parallel Strategies for Solving SURE Models with Variance Inequalities and Positivity of Correlations Constraints
The problem of computing estimates of parameters in SURE models with variance inequalities and positivity of correlations constraints is considered. Efficient algorithms that exploit the block bidiagonal structure of the data matrix are presented. The computational complexity of the main matrix factorizations is analyzed. A compact method to solve the model with proper subset regressors is proposed. Citation Copyright 2000 by Kluwer Academic Publishers.
Volume (Year): 15 (2000)
Issue (Month): 1-2 (April)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:15:y:2000:i:1-2:p:89-106. 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: (Sonal Shukla)or (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.