Skip to Main content Skip to Navigation

Linear programming problems for frontier estimation

Guillaume Bouchard 1 Stéphane Girard 1 Anatoli Iouditski 1 Alexander Nazin 2
1 IS2 - Statistical Inference for Industry and Health
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Abstract : We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel functions applied to the points of the sample. The coefficients of the linear combination are then computed by solving a linear programming problem. In the general case, the solution of the optimizat- ion problem is sparse, that is, only a few coefficients are non zero. The corresponding points play the role of support vectors in the statistical learning theory. The L_1 error between the estimated and the true frontiers is shown to be almost surely converging to zero, and the rate of convergence is provided. The behaviour of the estimates on finite sample situations is illustrated on some simulations.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:03:40 PM
Last modification on : Tuesday, July 14, 2020 - 11:04:05 AM
Long-term archiving on: : Sunday, April 4, 2010 - 8:23:12 PM


  • HAL Id : inria-00071869, version 1



Guillaume Bouchard, Stéphane Girard, Anatoli Iouditski, Alexander Nazin. Linear programming problems for frontier estimation. [Research Report] RR-4717, INRIA. 2003. ⟨inria-00071869⟩



Record views


Files downloads