Skip to main content
Download PDF
- Main
Majorization Algorithms for Logit, Probit, and Tobit Models
Abstract
For a large variety of discrete choice models (or contingency table models) efficientand stable maximum likelihood methods can be constructed basedon the majorization method. The course introduces majorization methods for algorithm construction. We show how to use the majorization principle to reduce complicated optimization problems to sequences of weighted or unweighted least squares problems.
Majorization methods are then applied to data analysis techniques used in economics, political science, psychometrics, ecology, sociology, and education.
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%