The M algorithm is a widely used technique for finding maximum likelihood (ML) estimates when the data are not fully observed. Despite its popularity for computing ML estimates in unrestricted problems and the need for simplified computations for problems with equality and inequality restrictions, there have been few applications of the algorithm to restricted ML estimation. The EM algorithm is presented for restricted ML estimation and provides its applications to the probit model under equality and inequality restrictions using two small data sets. Copyright 2002 by Taylor and Francis Group
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. 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.