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

DOI10.1080/10556788.2023.2198769OpenAlexW4377140088MaRDI QIDQ6078428FDOQ6078428

Authors: Amir Beck, Raz Sharon 

Publication date: 27 September 2023

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2023.2198769

Recommendations

• New results on multi-dimensional linear discriminant analysis
• scientific article; zbMATH DE number 7267211
• A comparison of generalized linear discriminant analysis algorithms
• Linear dimensionality reduction by maximizing the Chernoff distance in the transformed space
• Fast Algorithms for the Generalized Foley–Sammon Discriminant Analysis

zbMATH Keywords

Fisher linear discriminant analysisnonconvex optimization problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)

Cites Work

• Pattern recognition and machine learning.
• Projections onto order simplexes
• Active set algorithms for isotonic regression; a unifying framework
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Interior-Point Method for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Branch-and-Bound Methods: A Survey
• Understanding and using linear programming
• The trace ratio optimization problem

This page was built for publication: A branch and bound method solving the max–min linear discriminant analysis problem

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