A minimax theorem with applications to machine learning, signal processing, and finance

This paper concerns a fractional function of the form x
^T
a/√x
^T
Bx, where B is positive definite. We consider the game of choosing χ from a convex set, to maximize the function, and choosing (a, B) from a convex set, to minimize it. We prove the existence of a saddle point and describe an efficient method, based on convex optimization, for computing it. We describe applications in machine learning (robust Fisher linear discriminant analysis), signal processing (robust beamforming, robust matched filtering), and finance (robust portfolio selection). In these applications, χ corresponds to some design variables to be chosen, and the pair (a, B) corresponds to the statistical model, which is uncertain.