Newton-type algorithm for the theta-step
See Marazzi A. (1993), p.295
gytstp(x, y, ci, theta, wa, cov, ni, oi = 0, gam = .dFvGet()$gma, tol = .dFvGet()$tlo, tau = .dFvGet()$tua, iopt = .dFvGet()$ipo, icase = .dFvGet()$ics, icnv = .dFvGet()$icn, maxit = .dFvGet()$mxt, nitmon = .dFvGet()$ntm)
x |
See reference |
y |
See reference |
ci |
See reference |
theta |
See reference |
wa |
See reference |
cov |
See reference |
ni |
See reference |
oi |
See reference |
gam |
See reference |
tol |
See reference |
tau |
See reference |
iopt |
See reference |
icase |
See reference |
icnv |
See reference |
maxit |
See reference |
nitmon |
See reference |
See reference
Marazzi A. (1993) Algorithm, Routines, and S functions for Robust Statistics. Wadsworth & Brooks/cole, Pacific Grove, California. p.295
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.