Locating hyperplanes to fitting set of points: a general framework
From MaRDI portal
Publication:1652646
DOI10.1016/j.cor.2018.03.009zbMath1458.90467arXiv1505.03451OpenAlexW2793195120WikidataQ58217115 ScholiaQ58217115MaRDI QIDQ1652646
Víctor Blanco, Román Salmerón, Justo Puerto
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03451
Linear regression; mixed models (62J05) Continuous location (90B85) Nonconvex programming, global optimization (90C26)
Related Items (9)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ On $\ell_p$-Support Vector Machines and Multidimensional Kernels ⋮ Optimal arrangements of hyperplanes for SVM-based multiclass classification ⋮ Robust optimal classification trees under noisy labels ⋮ Fairness in maximal covering location problems ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Optimization problems for machine learning: a survey ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Best subset selection via a modern optimization lens
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Discrete optimization methods to fit piecewise affine models to data points
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Least quantile regression via modern optimization
- Multiple criteria linear regression
- A flexible model and efficient solution strategies for discrete location problems
- Coefficients of determination for least absolute deviation analysis
- An iterative linear programming solution to the Euclidean regression model
- Locating lines and hyperplanes. Theory and algorithms
- Arbitrary-norm separating plane
- Orthogonal linear regression algorithm based on augmented matrix formulation
- The determination of a ``least quantile of squares regression line for all quantiles
- Continuous location of dimensional structures.
- \(k\)-plane clustering
- Alternative methods of linear regression
- Ordered weighted average optimization in multiobjective spanning tree problem
- Pareto-optimality in linear regression
- Geodesic regression and the theory of least squares on Riemannian manifolds
- Ordered weighted average combinatorial optimization: formulations and their properties
- Location Theory
- Ordered median functions and symmetries
- Least Median of Squares Regression
- Classification and Regression via Integer Optimization
- Finding Least-Distances Lines
- Using Block Norms for Location Modeling
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Disjunctive Programming
- Aggregation Error Bounds for a Class of Location Models
- Modelling Inter-city Road Distances by Mathematical Functions
- TESTING FOR SERIAL CORRELATION IN LEAST SQUARES REGRESSION. II
- On the circle closest to a set of points
This page was built for publication: Locating hyperplanes to fitting set of points: a general framework
