Minmax-distance approximation and separation problems: geometrical properties

DOI10.1007/S10107-010-0387-1MaRDI QIDQ2429461zbMATH OpenOpenAlexFDO

Authors Frank Plastria, Emilio Carrizosa

Publication date 27 April 2012

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://idus.us.es/handle//11441/107711

zbMATH Keywords

center hyperplanegauge-distance to hyperplanelinear separation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Minimax problems in mathematical programming (90C47)

Recommendations

• Gauge distances and median hyperplanes
• Median and center hyperplanes in Minkowski spaces -- a unified approach
• Median hyperplanes in normed spaces -- a survey
• Anchored hyperplane location problems
• Optimal expected-distance separating halfspace

Cites work

• 1-Segment Center Problems
• A destination optimality in asymmetric distance Fermat-Weber problems
• Alternating local search based VNS for linear classification
• Anchored hyperplane location problems
• Arbitrary-norm separating plane
• Computing the width of a set
• Continuous location of dimensional structures.
• Fitting hyperplanes by minimizing orthogonal deviations
• Gauge distances and median hyperplanes
• Geometric complexity of some location problems
• Geometrical properties of the Fermat-Weber problem
• scientific article; zbMATH DE number 431989 (Why is no real title available?)
• scientific article; zbMATH DE number 4153914 (Why is no real title available?)
• scientific article; zbMATH DE number 140468 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 3214054 (Why is no real title available?)
• scientific article; zbMATH DE number 3231758 (Why is no real title available?)
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Linear Facility Location in Three Dimensions—Models and Solution Methods
• Linear facility location. Solving extensions of the basic problem
• Locating a central hunter on the plane
• Locating a minisum circle in the plane
• Locating an obnoxious plane
• Locating Objects in the Plane Using Global Optimization Techniques
• Median and center hyperplanes in Minkowski spaces -- a unified approach
• On a Geometric Notion of Quantiles for Multivariate Data
• On the circle closest to a set of points
• On the complexity of locating linear facilities in the plane
• Optimal expected-distance separating halfspace
• Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
• Support-vector networks
• The Chebyshev hyperplane optimization problem
• Two characterizations of smooth norms

Cited in

(6)

• The Chebyshev hyperplane optimization problem
• Cost-sensitive feature selection for support vector machines
• Linear separation and approximation by minimizing the sum of concave functions of distances
• On the horseshoe conjecture for maximal distance minimizers
• Gauge distances and median hyperplanes
• Mathematical optimization modelling for group counterfactual explanations

This page was built for publication: Minmax-distance approximation and separation problems: geometrical properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429461)