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

DOI10.1080/10556788.2023.2198769OpenAlexW4377140088MaRDI QIDQ6078428

Raz Sharon, Amir Beck

Publication date: 27 September 2023

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

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

zbMATH Keywords

Fisher linear discriminant analysisnonconvex optimization problem

Mathematics Subject Classification ID

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

Cites Work

• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Active set algorithms for isotonic regression; a unifying framework
• Understanding and using linear programming
• Projections onto order simplexes
• On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
• The Trace Ratio Optimization Problem
• An Interior-Point Method for Semidefinite Programming
• Branch-and-Bound Methods: A Survey
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item

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