Novel approaches to the discrimination problem
From MaRDI portal
Publication:4031377
DOI10.1007/BF01416243zbMath0762.90090OpenAlexW1974208065MaRDI QIDQ4031377
Gilles Savard, Patrice Marcotte
Publication date: 1 April 1993
Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01416243
Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Bilevel and multilevel programming: A bibliography review, A new implicit enumeration scheme for the discriminant analysis problem, Exact \(L_{2}\)-norm plane separation, Tabu search approaches for solving the two-group classification problem, A tabu search with an oscillation strategy for the discriminant analysis problem, MOP/GP models for machine learning, A hybrid tabu-ascent algorithm for the linear bilevel programming problem, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Computational complexity of norm-maximization
- A comparison of a robust mixed-integer approach to existing methods for establishing classification rules for the discriminant problem
- Discriminant analysis via mathematical programming: Certain problems and their causes
- Evaluating the maximize minimum distance formulation of the linear discriminant problem
- Simple but powerful goal programming models for discriminant problems
- The densest hemisphere problem
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- On the complexity of four polyhedral set containment problems
- Finding the nearest point in A polytope
- Maximization of A convex quadratic function under linear constraints
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
