Nonnegative minimum biased quadratic estimation in mixed linear models
From MaRDI portal
Publication:1599237
DOI10.1006/jmva.2000.1979zbMath0998.62053OpenAlexW2070931027MaRDI QIDQ1599237
Stanisław Gnot, Mariusz Grządziel
Publication date: 28 November 2002
Published in: Journal of Multivariate Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/4d94551dca2947a533fa35ee1d29b93227045d89
mean squared errorsymmetric conemixed linear modelprimal-dual interior-point methodone-way classification modelquadratic estimationnonnegative minimum biased estimators
Estimation in multivariate analysis (62H12) Linear regression; mixed models (62J05) Convex programming (90C25) Applications of mathematical programming (90C90)
Related Items
Best Quadratic Unbiased Prediction in a General Linear Model with Stochastic Regression Coefficients, MinimumLpNorm Estimator for Simple Linear Regressive Model, Nonnegative quadratic estimation and quadratic sufficiency in general linear models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SeDuMi
- Nonnegative unbiased estimability of linear combinations of two variance components
- Nonnegativity of admissible invariant quadratic estimates in mixed linear models with two variance components
- A cyclic projection algorithm via duality
- Applications of second-order cone programming
- On the existence of unbiased nonnegative estimates of variance covariance components
- Nonnegative minimum biased invariant estimation in variance component models
- Nonnegative minimum biased quadratic estimation in the linear regression models
- Nonnegative quadratic estimation of the mean squared errors of minimax estimators in the linear regression model
- A Note on Uniformly Best Unbiased Estimators for Variance Components
- Linear models and convex geometry: aspects of non-negative variance estimation1
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Quadratic Subspaces and Completeness