Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2009
DOI: 10.1007/s11222-009-9124-0
|View full text |Cite
|
Sign up to set email alerts
|

Least squares and shrinkage estimation under bimonotonicity constraints

Abstract: In this paper we describe active set type algorithms for minimization of a smooth function under general order constraints, an important case being functions on the set of bimonotone r × s matrices. These algorithms can be used, for instance, to estimate a bimonotone regression function via least squares or (a smooth approximation of) least absolute deviations. Another application is shrinkage estimation in image denoising or, more generally, regression problems with two ordinal factors after representing the … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
16
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(17 citation statements)
references
References 7 publications
1
16
0
Order By: Relevance
“…isotonic with respect to bimonotone order relation on a set X , if whenever x 1 x 2 one has g(x 1 ) ≤ g(x 2 ), cf. [7]. A real valued function h(x) is called a bimonotone decreasing function, if whenever x 1…”
Section: Application To Bimonotone Probability Mass Function and Regrmentioning
confidence: 99%
See 1 more Smart Citation
“…isotonic with respect to bimonotone order relation on a set X , if whenever x 1 x 2 one has g(x 1 ) ≤ g(x 2 ), cf. [7]. A real valued function h(x) is called a bimonotone decreasing function, if whenever x 1…”
Section: Application To Bimonotone Probability Mass Function and Regrmentioning
confidence: 99%
“…[16]. In this setting we would also like to mention [7], that studied algorithms resulting from the minimisation of a smooth criterion function under bimonotonicity constraints. In the regression setting we are able to derive the limit distributions for the isotonic regression of functions that are monotone with respect to the matrix pre-order on Z d + , for arbitrary d > 1, cf.…”
Section: Introductionmentioning
confidence: 99%
“…Algorithms for isotonic regressions on multidimensional orderings, without imposing restrictions such as additive models, have concentrated on 2 dimensions [5,12,14,25,30,31,36]. For the L 2 metric and 2-dimensional points, the fastest known algorithms take Θ(n 2 ) time if the points are in a grid [36] and Θ(n 2 log n) time for points in general position [39], while for L 1 the times are Θ(n log n) and Θ(n log 2 n), respectively [39].…”
Section: Multidimensional Orderingmentioning
confidence: 99%
“…Recent papers considering additional information issues are, for example, Beran and Dümbgen (2010) and Oh and Shin (2011). It is frequent that this information tells us that the observations from one of the populations, for example Π 1 , take higher (or lower) values than those coming from the other, i.e.…”
Section: Introductionmentioning
confidence: 99%