IDEAS home Printed from https://ideas.repec.org/a/taf/apeclt/v9y2002i12p779-781.html
   My bibliography  Save this article

Restricted EM algorithm with application to probit models

Author

Listed:
  • Sunil Sapra

Abstract

The EM 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.

Suggested Citation

  • Sunil Sapra, 2002. "Restricted EM algorithm with application to probit models," Applied Economics Letters, Taylor & Francis Journals, vol. 9(12), pages 779-781.
    • Handle: RePEc:taf:apeclt:v:9:y:2002:i:12:p:779-781
    DOI: 10.1080/13504850210135697
    as

    Download full text from publisher

    File URL: http://www.informaworld.com/openurl?genre=article&doi=10.1080/13504850210135697&magic=repec&7C&7C8674ECAB8BB840C6AD35DC6213A474B5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13504850210135697?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:taf:apeclt:v:9:y:2002:i:12:p:779-781. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEL20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.