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.
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.
Volume (Year): 15 (2000)
Issue (Month): 1-2 (April)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/10614/PS2|
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 (Rebekah McClure)
If references are entirely missing, you can add them using this form.