A branch and bound method solving the max-min linear discriminant analysis problem.
Amir BeckRaz SharonPublished in: Optim. Methods Softw. (2023)
Keyphrases
- linear discriminant analysis
- max min
- branch and bound method
- discriminant analysis
- principal component analysis
- branch and bound
- face recognition
- dimensionality reduction
- min max
- mixed integer programming
- feature extraction
- lower bound
- feature space
- branch and bound algorithm
- combinatorial optimization
- null space
- support vector
- support vector machine svm
- high dimensional data
- reduce the search space
- optimal solution
- feasible solution
- robust optimization
- optimal configuration
- machine learning
- lot sizing
- mathematical programming
- pattern recognition
- multistage
- model selection
- low dimensional
- nearest neighbor
- upper bound