Restricted parameter space estimation problems. Admissibility and minimaxity properties. (Q851944): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-0-387-48809-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2486394056 / rank
 
Normal rank

Latest revision as of 21:42, 19 March 2024

scientific article
Language Label Description Also known as
English
Restricted parameter space estimation problems. Admissibility and minimaxity properties.
scientific article

    Statements

    Restricted parameter space estimation problems. Admissibility and minimaxity properties. (English)
    0 references
    27 November 2006
    0 references
    The book under review is addressed to the audience interested in the subject of admissibility and minimaxity in restricted-parameter-space estimation. It covers results from the time when the subject began to be studied (early 1950s) to the middle of 2004, depicts relationships between various results, and points out open problems. The topic of hypothesis testing is not touched here. The introduction, which gives some history and examples, is followed by seven chapters. In Chapter 2, a general statement of the problem is offered. Chapters 3 and 4 contain, respectively, results on admissibility and minimaxity when there are no nuisance parameters. Results for the case where nuisance parameters are present are the topic of Chapter 5, while Chapter 6 deals with results for linear models. Some other properties of restricted parameter space estimators, such as robustness to misspecification of the parameter space and unbiasedness, as well as relationships with Hu and Zidek's weighted likelihood estimation, can be found in Chapter 7. Chapter 8 contains existence results for maximum likelihood estimators under order restrictions on the parameters, and some properties of these estimators (together with computational algorithms) are given. An extensive bibliography is provided.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references