What is invexity?

Abstract Recently it was shown that many results in Mathematical Programming involving convex functions actually hold for a wider class of functions, called invex. Here a simple characterization of invexity is given for both constrained and unconstrained problems. The relationship between invexity and other generalizations of convexity is illustrated. Finally, it is shown that invexity can be substituted for convexity in the saddle point problem and in the Slater constraint qualification.

[1]  E. Choo,et al.  On functions whose stationary points are global minima , 1977 .

[2]  W. Ziemba,et al.  Generalized concavity in optimization and economics , 1981 .

[3]  M. A. Hanson.  On sufficiency of the Kuhn-Tucker conditions , 1981 .

[4]  B. Craven.  Invex functions and constrained local minima , 1981, Bulletin of the Australian Mathematical Society.

[5]  D. H. Martin.  The essence of invexity , 1985 .

[6]  Surjeet Kaur,et al.  Optimality Criteria in Nonlinear Programming Involving Nonconvex Functions , 1985 .

[7]  B. M. Glover,et al.  Invex functions and duality , 1985, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[8]  Bertram Mond,et al.  Duality with generalized convexity , 1986, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[9]  M. A. Hanson,et al.  Necessary and sufficient conditions in constrained optimization , 1987, Math. Program..

[10]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .