Nonnegative Minimum Biased Quadratic Estimation in Mixed Linear Models
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Norbert Gaffke & Rudolf Mathar, 1989. "A cyclic projection algorithm via duality," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 36(1), pages 29-54, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Liu, Xu-qing & Rong, Jian-ying, 2007. "Nonnegative quadratic estimation and quadratic sufficiency in general linear models," Journal of Multivariate Analysis, Elsevier, vol. 98(6), pages 1180-1194, July.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- F. Deutsch & W. Li & J. Swetits, 1999. "Fenchel Duality and the Strong Conical Hull Intersection Property," Journal of Optimization Theory and Applications, Springer, vol. 102(3), pages 681-695, September.
- Chao Ding & Hou-Duo Qi, 2017. "Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation," Computational Optimization and Applications, Springer, vol. 66(1), pages 187-218, January.
- Groenen, P.J.F. & van der Lans, A., 2006. "Multidimensional Scaling with Regional Restrictions for Facet Theory: An Application to Levi's Political Protest Data," ERIM Report Series Research in Management ERS-2006-057-MKT, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Frank de Meijer & Renata Sotirov, 2021. "SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1262-1276, October.
- Chin How Jeffrey Pang, 2019. "Dykstra’s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 1019-1049, September.
- Tomáš Dlask, 2024. "Projection methods for finding the greatest element of the intersection of max-closed convex sets," Annals of Operations Research, Springer, vol. 340(2), pages 811-836, September.
More about this item
Keywords
mixed linear model quadratic estimation nonnegative minimum biased estimators mean squared error one-way classification model symmetric cone primal-dual interior-point method;Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jmvana:v:80:y:2002:i:2:p:217-233. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.