Estimating Monotone Convex Functions via Sequential Shape Modification
نویسندگان
چکیده
We propose a sequential method to estimate monotone convex function that consists of: (i) monotone regression via solving a constrained least square problem and (ii) convexification of the monotone regression estimate via solving an associated constrained uniform approximation problem. We show that this method is faster than the constrained least squares (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 nonparametric 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 analyzing ground water level data of wells in Korea.
منابع مشابه
Shape constrained kernel density estimation
In this paper, a method for estimating monotone, convex and log-concave densities is proposed. The estimation procedure consists of an unconstrained kernel estimator which is modified in a second step with respect to the desired shape constraint by using monotone rearrangements. It is shown that the resulting estimate is a density itself and shares the asymptotic properties of the unconstrained...
متن کاملThe Shape of the Borwein-Affleck-Girgensohn Function Generated by Completely Monotone and Bernstein Functions
Borwein, Affleck, and Girgensohn (2000) posed a problem concerning the shape (that is, convexity, log-convexity, reciprocal concavity) of a certain function of several arguments that had manifested in a number of contexts concerned with optimization problems. In this paper we further explore the shape of the Borwein-Affleck-Girgensohn function and especially its extensions generated by complete...
متن کاملOn Nonparametric Tests of Positivity / Monotonicity / Convexity
We consider the problem of estimating the distance from an unknown signal, observed in a white-noise model, to convex cones of positive/monotone/convex functions. We show that, when the unknown function belongs to a Hölder class, the risk of estimating the Lr -distance, 1 ≤ r < ∞, from the signal to a cone is essentially the same (up to a logarithmic factor) as that of estimating the signal its...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملEstimation of a K − Monotone Density , Part 1 : Characterizations , Consistency , and Minimax Lower
Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k−monotone densities. A density g is said to be k−monotone if (−1)g is nonnegative, nonincreasing and convex for l = 0, . . . , k−2 if k ≥ 2, and g is simply nonincreasing if k = 1. These classes of sha...
متن کامل