Full metadata record
DC FieldValueLanguage
dc.contributor.authorDette, Holger-
dc.contributor.authorMelas, Viatcheslav B.-
dc.contributor.authorPepelyshev, Andrey-
dc.date.accessioned2006-11-10T07:43:32Z-
dc.date.available2006-11-10T07:43:32Z-
dc.date.issued2006-11-10T07:43:32Z-
dc.identifier.otherAMS Subject Classification: Primary 62K05; Secondary: 65D10-
dc.identifier.urihttp://hdl.handle.net/2003/23069-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-15404-
dc.description.abstractIn this paper D-optimal designs for free knot least squares spline estimation are investigated. In contrast to most of the literature on optimal design for spline regression models it is assumed that the knots of the spline are also estimated from the data, which yields to optimal design problems for nonlinear models. In some cases local D-optimal designs can be found explicitly. Moreover, it is shown that the points of minimally supported D-optimal designs are increasing and real analytic functions of the knots and these results are used for the numerical construction of local D-optimal designs by means of Taylor expansions. In order to obtain optimal designs which are less sensitive with respect to a specification of the unknown knots a maximin approach is proposed and standardized maximin D-optimal designs for least square splines with estimated knots are determined in the class of all minimally supported designs.en
dc.format.extent265823 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.subjectD-optimal designen
dc.subjectFree knot least squares splinesen
dc.subjectLocal optimal designen
dc.subjectNonlinear modelen
dc.subjectRobust designen
dc.subjectSaturated designen
dc.subject.ddc004-
dc.titleOptimal designs for free knot least squares splinesen
dc.typeTextde
dc.type.publicationtypereporten
dcterms.accessRightsopen access-
Appears in Collections:Sonderforschungsbereich (SFB) 475

Files in This Item:
File Description SizeFormat 
tr34-06.pdfDNB259.59 kBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org