What is invexity?
- 1 July 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 28 (1) , 1-9
- https://doi.org/10.1017/s0334270000005142
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.This publication has 6 references indexed in Scilit:
- The essence of invexityJournal of Optimization Theory and Applications, 1985
- Invex functions and dualityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985
- Optimality criteria in nonlinear programming involving nonconvex functionsJournal of Mathematical Analysis and Applications, 1985
- Invex functions and constrained local minimaBulletin of the Australian Mathematical Society, 1981
- On sufficiency of the Kuhn-Tucker conditionsJournal of Mathematical Analysis and Applications, 1981
- On functions whose stationary points are global minimaJournal of Optimization Theory and Applications, 1977