MATRIX-THEORETIC CRITERIA FOR THE QUASI-CONVEXITY AND PSEUDO-CONVEXITY OF QUADRATIC FUNCTIONS.
STANFORD UNIV CALIF OPERATIONS RESEARCH HOUSE
Pagination or Media Count:
It is well known that quasi-convexity and pseudo-convexity play a natural role in nonlinear programming theory. Despite this, it is said that these notions lack utility because they have defining conditions involving infinitely many inequalities and are not easily checked. The aim of the paper is to prove that testing the quasi-convexity pseudo-convexity of a quadratic function on the nonnegative semipositive orthant can be reduced to an examination of finitely many conditions.
- Operations Research