Estimating monotone convex functions via sequential shape modification

Sanghan Lee, Johan Lim, Seung Jean Kim, Yongsung Joo

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a sequential method to estimate monotone convex functions that consists of: (i) monotone regression via solving a constrained least square (LS) problem and (ii) convexification of the monotone regression estimate via solving a uniform approximation problem with associated constraints.We show that this method is faster than the constrained LS method. The ratio of computation time increases as data size increases. Moreover, we show that, under an appropriate smoothness condition, the uniform convergence rate achieved by the proposed method is nearly comparable to the best achievable rate for a non-parametric estimate which ignores the shape constraint. Simulation studies show that our method is comparable to the constrained LS method in estimation error. We illustrate our method by analysing ground water level data of wells in Korea.

Original languageEnglish
Pages (from-to)989-1000
Number of pages12
JournalJournal of Statistical Computation and Simulation
Volume79
Issue number8
DOIs
StatePublished - 2009

Keywords

  • Constrained least square method
  • Convergence rate
  • Monotone convexity
  • Non-parametric estimation
  • Uniform approximation

Fingerprint

Dive into the research topics of 'Estimating monotone convex functions via sequential shape modification'. Together they form a unique fingerprint.

Cite this