leastFavorableRadius(L2Fam, neighbor, risk, ...)
"leastFavorableRadius"( L2Fam, neighbor, risk, rho, upRad = 1, z.start = NULL, A.start = NULL, upper = 100, OptOrIter = "iterate", maxiter = 100, tol = .Machine$double.eps^0.4, warn = FALSE, verbose = NULL)"Neighborhood". "RiskType". A and a: if (partially) matched to "optimize",
getLagrangeMultByOptim is used; otherwise: by default, or if matched to
"iterate" or to "doubleiterate",
getLagrangeMultByIter is used. More specifically,
when using getLagrangeMultByIter, and if argument risk is of
class "asGRisk", by default and if matched to "iterate"
we use only one (inner) iteration, if matched to "doubleiterate"
we use up to Maxiter (inner) iterations.TRUE, some messages are printed Rieder, H., Kohl, M. and Ruckdeschel, P. (2001) The Costs of not Knowing the Radius. Submitted. Appeared as discussion paper Nr. 81. SFB 373 (Quantification and Simulation of Economic Processes), Humboldt University, Berlin; also available under www.uni-bayreuth.de/departments/math/org/mathe7/RIEDER/pubs/RR.pdf
Ruckdeschel, P. (2005) Optimally One-Sided Bounded Influence Curves. Mathematical Methods in Statistics 14(1), 105-131.
Kohl, M. (2005) Numerical Contributions to the Asymptotic Theory of Robustness. Bayreuth: Dissertation.
radiusMinimaxICN <- NormLocationFamily(mean=0, sd=1)
leastFavorableRadius(L2Fam=N, neighbor=ContNeighborhood(),
risk=asMSE(), rho=0.5)
Run the code above in your browser using DataLab