MATRIX-THEORETIC CRITERIA FOR THE QUASI-CONVEXITY AND PSEUDO-CONVEXITY OF QUADRATIC FUNCTIONS.

Abstract

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.

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1970
Accession Number
AD0706022

Entities

People

  • Jacques A. Ferland
  • Richard Cottle

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Computer Programming
  • Computing-Related Activities
  • Inequalities
  • Interdisciplinary Science
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming

Readers

  • Allergy and Immunology.
  • Control Systems Engineering.
  • Mathematical Modeling and Probability Theory.