Arbitrary-norm separating plane

DOI10.1016/S0167-6377(98)00049-2zbMath1028.90037OpenAlexW2073429525MaRDI QIDQ1306363

Publication date: 27 January 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(98)00049-2

zbMATH Keywords

separating plane $p$-norm projection $p$-norm separation

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Numerical methods based on nonlinear programming (49M37)

Related Items

Generalized isotone projection cones ⋮ Massive data classification via unconstrained support vector machines ⋮ On $\ell_p$-Support Vector Machines and Multidimensional Kernels ⋮ A pure $L_1$-norm principal component analysis ⋮ Lagrangian relaxation for SVM feature selection ⋮ Locating hyperplanes to fitting set of points: a general framework ⋮ Supervised classification and mathematical optimization ⋮ Support vector machine classification via parameterless robust linear programming ⋮ A USE OF NONPARAMETRIC TESTS FOR DEA-DISCRIMINANT ANALYSIS: A METHODOLOGICAL COMPARISON ⋮ Optimal arrangements of hyperplanes for SVM-based multiclass classification ⋮ Distance rationalization of anonymous and homogeneous voting rules ⋮ Ellipsoidal buffered area under the curve maximization model with variable selection in credit risk estimation ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ Generalized projections onto convex sets ⋮ Mixed integer programming approach of extended DEA--discriminant analysis. ⋮ Decomposing economic efficiency into technical and allocative components: an essential property ⋮ Support vector machines for classification of input vectors with different metrics ⋮ 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 ⋮ A well-defined efficiency measure for dealing with closest targets in DEA ⋮ Multiple instance classification via successive linear programming ⋮ Geometrical Properties of Nu Support Vector Machines with Different Norms ⋮ Exact $L_{2}$-norm plane separation ⋮ Breast tumor susceptibility to chemotherapy via support vector machines ⋮ Continuous location under the effect of `refraction' ⋮ A METHODOLOGICAL COMPARISON BETWEEN STANDARD AND TWO STAGE MIXED INTEGER APPROACHES FOR DISCRIMINANT ANALYSIS ⋮ Support vector machines based on convex risk functions and general norms ⋮ Optimization approaches to supervised classification ⋮ On how to properly calculate the Euclidean distance-based measure in DEA ⋮ Foreword: special issue for the 70th birthday of professor Olvi Mangasarian ⋮ Alternating local search based VNS for linear classification ⋮ A Newton method for linear programming ⋮ Gauge distances and median hyperplanes ⋮ The distance between two convex sets ⋮ A new maximum margin algorithm for one-class problems and its boosting implementation ⋮ On the multisource hyperplanes location problem to fitting set of points ⋮ Boosting over non-deterministic ZDDs ⋮ Inverse optimization for the recovery of constraint parameters ⋮ Polyhedral separability through successive LP ⋮ A combinatorial approach to $L_1$-matrix factorization ⋮ The sparse signomial classification and regression model ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Support vector machine classifiers by non-Euclidean margins ⋮ DEA-DA for bankruptcy-based performance assessment: misclassification analysis of Japanese construction industry ⋮ DEA-discriminant analysis: methodological comparison among eight discriminant analysis approaches ⋮ Arbitrary-norm separating plane ⋮ Polyhedral separation via difference of convex (DC) programming ⋮ Locating a median line with partial coverage distance ⋮ On the exact separation of cover inequalities of maximum-depth ⋮ Interaction between financial risk measures and machine learning methods

Cites Work