A branch and bound method solving the max–min linear discriminant analysis problem

Keyphrases

• Max-min 100%
• Branch-and-bound Method 100%
• Linear Discriminant Analysis 100%
• Problem Analysis 100%
• Fisher 50%
• Dimensionality Reduction 50%
• Nonconvex Optimization Problems 50%
• Minimum Separation 50%
• One-dimensional Space 50%
• Fisher Linear Discriminant Analysis 50%

Mathematics

• Objective Function 100%
• Discriminant Analysis 100%
• Dimensional Space 50%