Gauge distances and median hyperplanes
From MaRDI portal
Publication:5947268
DOI10.1023/A:1017551731021zbMath1039.90036MaRDI QIDQ5947268
Frank Plastria, Emilio Carrizosa
Publication date: 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Continuous location (90B85) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (26)
Generalized isotone projection cones ⋮ Minkowski Geometry—Some Concepts and Recent Developments ⋮ Supervised classification and mathematical optimization ⋮ Tightening big Ms in integer programming formulations for support vector machines with ramp loss ⋮ Generating valid linear inequalities for nonlinear programs via sums of squares ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ Generalized projections onto convex sets ⋮ Continuous location of dimensional structures. ⋮ Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data ⋮ Gate points in continuous location between regions with different \(\ell _{p}\) norms ⋮ Linear separation and approximation by minimizing the sum of concave functions of distances ⋮ Locating an axis-parallel rectangle on a Manhattan plane ⋮ On a robustness property in single-facility location in continuous space ⋮ Geometric fit of a point set by generalized circles ⋮ The \(k\)-centrum straight-line location problem ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Pasting gauges. II: Balls in pasted halfplanes ⋮ A biobjective approach to recoverable robustness based on location planning ⋮ Location of weighted anti-ordered median straight lines with Euclidean distances ⋮ Alternating local search based VNS for linear classification ⋮ Minsum hyperspheres in normed spaces ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Deriving weights in multiple-criteria decision making with support vector machines ⋮ Solving scheduling and location problems in the plane simultaneously ⋮ Coproximinality of linear subspaces in generalized Minkowski spaces ⋮ Locating a median line with partial coverage distance
Cites Work
- Geometrical properties of the Fermat-Weber problem
- The design centering problem as a d.c. programming problem
- Locating lines and hyperplanes. Theory and algorithms
- Arbitrary-norm separating plane
- An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
- Fitting hyperplanes by minimizing orthogonal deviations
- The Asymmetric Distance Location Problem
- Convex Analysis
- Dominators for multiple-objective quasiconvex maximization problems
This page was built for publication: Gauge distances and median hyperplanes
