Skip to main content
SpringerLink
Log in

Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions

  • Published:
Mathematical Programming Submit manuscript

Abstract

We study quasi-convex and pseudo-convex quadratic functions on solid convex sets. This generalizes Martos' results in [12] and [13] by using Koecher's results in [8].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.J. Arrow and A.C. Enthoven, “Quasi-concave programming,”Econometrica 29 (1961) 779–800.

    Google Scholar 

  2. R.W. Cottle, “On the convexity of quadratic forms over convex sets,”Operations Research 15 (1967) 170–172.

    Google Scholar 

  3. R.W.Cottle and J.A. Ferland, “Matrix-theoretic criteria for the quasi-convexity and pseudoconvexity of quadratic functions,” Technical Report No.70-6, Operations Research House, Stanford University, April 1970;Linear Algebra and Its Applications, to appear.

  4. R.W. Cottle and J.A. Ferland, “On pseudo-convex functions of nonnegative variables,”Mathematical Programming 1 (1971) 95–101.

    Google Scholar 

  5. B.DeFinetti, “Sulle stratificazioni convesse,”Annali di Matematica Pura ed Applicata S.4 30 (1949) 173–183.

    Google Scholar 

  6. D. Gale,The theory of linear economic models (McGraw-Hill, New York, 1960).

    Google Scholar 

  7. W.H. Greub,Linear algebra (Springer-Verlag, New York, 1967) (Third Edition).

    Google Scholar 

  8. M. Koecher, “Positivitätsbereiche imR n,”American Journal of Mathematics 79 (1957) 576–596 (translated by R.W. Cottle, “Domains of positivity inR n,” Technical Report No. 68-8, Operations Research House, Stanford University, May 1968).

    Google Scholar 

  9. O.L. Mangasarian, “Pseudo-convex functions,”SIAM Journal on Control 3 (1965) 281–290.

    Google Scholar 

  10. O.L. Mangasarian, “Convexity, pseudo-convexity and quasi-convexity of composite functions,”Cahiers du Centre d'Etude de Recherche Opérationnelle 12 (1970) 114–122.

    Google Scholar 

  11. O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).

    Google Scholar 

  12. B. Martos, “Subdefinite matrices and quadratic forms,”SIAM Journal on Applied Mathematics 17 (1969) 1215–1223.

    Google Scholar 

  13. B. Martos, “Quadratic programming with a quasi-convex objective function,”Operations Research 19 (1971) 87–97.

    Google Scholar 

  14. H. Nikaido, “On von Neumann's minimax theorem,”Pacific Journal of Mathematics 4 (1954) 65–72.

    Google Scholar 

  15. J. Ponstein, “Seven kinds of convexity,”SIAM Review 9 (1967) 115–119.

    Google Scholar 

  16. H. Tuy, “Sur les inégalités linéaires,”Colloquium Mathematicum 13 (1964) 107–123.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Montreal, Montreal, Canada

    Jacques A. Ferland

Authors
  1. Jacques A. Ferland
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by Hydro—Quebec; University of Montreal; Office of Naval Research, Contract N-00014-47-A0112-0011; National Science Foundation, Grant GP 25738.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferland, J.A. Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions. Mathematical Programming 3, 178–192 (1972). https://doi.org/10.1007/BF01584988

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01584988

Keywords

Search

Navigation