1976
DOI: 10.1214/aos/1176343640
|View full text |Cite
|
Sign up to set email alerts
|

Consistency in Concave Regression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
75
0
1

Year Published

2000
2000
2016
2016

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 143 publications
(78 citation statements)
references
References 3 publications
2
75
0
1
Order By: Relevance
“…The estimation of concave regression functions (same context as above except that m(·) is known to be concave) has also been extensively considered (see e.g., Hildreth, 1954 andPledger, 1976) and its distribution is known in the least squares case (see Wang, 1993). Finally, algorithms that extend Hildreth's to estimate a regression curve under inequality restrictions have been proposed by Dykstra (1983) and Ruud (1997), again in the constrained least squares context.…”
Section: Introductionmentioning
confidence: 99%
“…The estimation of concave regression functions (same context as above except that m(·) is known to be concave) has also been extensively considered (see e.g., Hildreth, 1954 andPledger, 1976) and its distribution is known in the least squares case (see Wang, 1993). Finally, algorithms that extend Hildreth's to estimate a regression curve under inequality restrictions have been proposed by Dykstra (1983) and Ruud (1997), again in the constrained least squares context.…”
Section: Introductionmentioning
confidence: 99%
“…Indeed, it is easy to verify that the univariate CNLS formulation (5) by Hanson and Pledger (1976) is obtained as a special case of (6) when m = 1. We would conjecture that the known statistical properties of the univariate CNLS estimator (consistency, rate of convergence) carry over to the multivariate setting, but this remains to be formally shown.…”
Section: Stage 1: Cnls Estimationmentioning
confidence: 96%
“…In this respect, the recent studies Kuosmanen (2008) and Kuosmanen and Johnson (2010) have shown that DEA can be understood as a constrained special case of nonparametric least squares subject to shape constraints. More specifically, Kuosmanen and Johnson (2010) prove formally that the classic outputoriented DEA estimator can be computed in the singleoutput case by solving the convex nonparametric least squares (CNLS) problem (Hildreth 1954;Hanson and Pledger 1976;Groeneboom et al 2001a,b;Kuosmanen 2008) subject to monotonicity and concavity constraints that characterize the frontier, and a sign constraint on the regression residuals. Thus, DEA can be naturally viewed as a nonparametric counterpart to the parametric programming approach of Aigner and Chu (1968).…”
Section: Introductionmentioning
confidence: 99%
“…For more details about theoretical aspects, see Dümbgen et al (2004), where it is clarified how to apply also an isotonic constraints onf (see also Hanson and Pledger (1976); Aguilera et al (2011)). …”
Section: Endmentioning
confidence: 99%