An algorithm for isotonic median regression
From MaRDI portal
In this paper we give an algorithm for computing the solutions of the isotonic median regression problem, equivalent to the calculation of the maximum likelihood estimate for the parameter \(\theta =(\theta_ 1,...,\theta_ k)\), where \(\theta_ 1\) is the location parameter of the bilateral exponential distribution, under the assumption \(\theta_ 1\leq \theta_ 2\leq...\leq \theta_ k\).
Recommendations
Cites work
Cited in
(11)- An algorithm for computing multivariate isotonic regression
- Locating service centers with precedence constraints
- Locating a maximum using isotonic regression
- Efficient computation of an isotonic median regression
- The structure of isotonic regression class for LAD problems with quasi- order constraints
- An algorithm for isotonic regression with arbitrary convex distance function
- An isotonic regression problem for infinite-dimensional parameters
- scientific article; zbMATH DE number 89994 (Why is no real title available?)
- scientific article; zbMATH DE number 1124622 (Why is no real title available?)
- A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
- Bounded isotonic median regression
This page was built for publication: An algorithm for isotonic median regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578815)