Nonparametric regression and quantile regression (62G08) Analysis of variance and covariance (ANOVA) (62J10) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Abstract: Cone regression is a particular case of quadratic programming that minimizes a weighted sum of squared residuals under a set of linear inequality constraints. Several important statistical problems such as isotonic, concave regression or ANOVA under partial orderings, just to name a few, can be considered as particular instances of the cone regression problem. Given its relevance in Statistics, this paper aims to address the fundamentals of cone regression from a theoretical and practical point of view. Several formulations of the cone regression problem are considered and, focusing on the particular case of concave regression as example, several algorithms are analyzed and compared both qualitatively and quantitatively through numerical simulations. Several improvements to enhance numerical stability and bound the computational cost are proposed. For each analyzed algorithm, the pseudo-code and its corresponding code in Scilab are provided. The results from this study demonstrate that the choice of the optimization approach strongly impacts the numerical performances. It is also shown that methods are not currently available to solve efficiently cone regression problems with large dimension (more than many thousands of points). We suggest further research to fill this gap by exploiting and adapting classical multi-scale strategy to compute an approximate solution.
Recommendations
- scientific article; zbMATH DE number 4100438
- scientific article; zbMATH DE number 3850449
- Semi-parametric additive constrained regression
- A dual active set algorithm for optimal sparse convex regression
- An extension of the mixed primal-dual bases algorithm to the case of more constraints than dimensions
Cites work
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 4100438 (Why is no real title available?)
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 193111 (Why is no real title available?)
- scientific article; zbMATH DE number 1009689 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 3312384 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A critical index algorithm for nearest point problems on simplicial cones
- A cyclic projection algorithm via duality
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A new polynomial-time algorithm for linear programming
- A simple new algorithm for quadratic programming with applications in statistics
- A successive projection method
- An Algorithm for Restricted Least Squares Regression
- An active index algorithm for the nearest point problem in a polyhedral cone
- An extension of the mixed primal-dual bases algorithm to the case of more constraints than dimensions
- Convex Analysis
- Decomposition through formalization in a product space
- Finding projections onto the intersection of convex sets in hilbert spaces
- How good are projection methods for convex feasibility problems?
- Interior-point methods for linear programming: a review
- Kernel Least-Squares Models Using Updates of the Pseudoinverse
- Multiplier and gradient methods
- Note—A Note on Least Squares Fitting of Functions Constrained to be Either Nonnegative, Nondecreasing or Convex
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the convergence of Han's method for convex programming with quadratic objective
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Point Estimates of Ordinates of Concave Functions
- Proximal splitting methods in signal processing
- Recursive least squares with linear constraints
- Representation theorem for convex nonparametric least squares
- Technical Note—On the Estimation of Convex Functions
- The Nonparametric Approach to Production Analysis
Cited in
(2)
This page was built for publication: Fundamentals of cone regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289730)
