The computation of robust regression estimates often relies on minimization of a convex functional on a convex set. In this paper we discuss a general technique for a large class of convex functionals to compute the minimizers iteratively which is closely related to majorization-minimization...

The computation of robust regression estimates often relies on minimization of a convex functional on a convex set. In this paper we discuss a general technique for a large class of convex functionals to compute the minimizers iteratively which is closely related to majorization-minimization...

A new test for strict monotonicity of the regression function is proposed which is based on a composition of an estimate of the inverse of the regression function with a common regression estimate. This composition is equal to the identity if and only if the ?true? regression function is...

A new test for strict monotonicity of the regression function is proposed which is based on a composition of an estimate of the inverse of the regression function with a common regression estimate. This composition is equal to the identity if and only if the ?true? regression function is...

We revisit Hawkins’ (Comput Stat 9(3):233–247, <CitationRef CitationID="CR15">1994</CitationRef>) algorithm for fitting monotonic polynomials and discuss some practical issues that we encountered using this algorithm, for example when fitting high degree polynomials or situations with a sparse design matrix but multiple observations...</citationref>