The lower bound method in probit regression. (Q1285476): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Likelihood inference for mixtures: Geometrical and other constructions of monotone step-length algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multinomial logistic regression algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity of quadratic-approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998435 / rank
 
Normal rank

Latest revision as of 19:43, 28 May 2024

scientific article
Language Label Description Also known as
English
The lower bound method in probit regression.
scientific article

    Statements

    The lower bound method in probit regression. (English)
    0 references
    28 April 1999
    0 references
    0 references
    Probit link function and probit regression
    0 references
    Generalized linear model
    0 references
    Lower bound method
    0 references
    Quadratic approximation of log-likelihood
    0 references
    0 references