We analyze two popular semidefinite programming relaxations for quadratically constrained quadratic programs with matrix variables. These relaxations are based on vector lifting and on matrix lifting; ...

Abstract: An efficient framework is conceived for fractional matrix programming (FMP) optimization problems (OPs) namely for minimization and maximization. In each generic OP, either the objective or ...

Project Overview: Implicit parallelism in parallel programming allows platforms to automatically identify and execute parallel tasks without explicit directives from programmers. In OpenMP, this is ...

Abstract: This paper presents (1) a new characterization, via linear programming, of extreme optimal strategies of a matrix game and (2) a simple direct procedure for computing them. The first ...