Quadratic Programming with a Quasiconvex Objective Function
Béla Martos · Operations Research · 1971
This paper gives both necessary and sufficient conditions for a quadratic function to be quasiconvex in the nonnegative orthant. Methods of pseudoconvex programming (such as those of Frank and Wolfe) can solve linearly constrained quadratic programming problems with such an objective function.