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.
(This abstract was borrowed from another version of this item.)
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:|
|Contact details of provider:|| Postal: CEF97, Stanford University, Department of Economics, Stanford CA USA|
Web page: http://bucky.stanford.edu/cef97/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf7:45. 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: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.