Generalized invexity for nonsmooth vector-valued mappings
- 1 January 1989
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 10 (11-12) , 1191-1202
- https://doi.org/10.1080/01630568908816352
Abstract
We define four types of invexity for Lipschitz vector-valued mappings from Rp to Rq that generalize previous definitions of invexity in the differentiable setting. After establishing relationships between the various definitions, we show the importance of the concept of nonsmooth invexity in the field of optimization. In particular, we obtain conditions sufficient for optimality in unconstrained and cone-constrained nondifferentiable programming that are weaker than previous conditions presented in the literature; we also obtain weak and strong duality results.Keywords
This publication has 14 references indexed in Scilit:
- Optimality criteria in mathematical programming involving generalized invexityJournal of Mathematical Analysis and Applications, 1988
- Necessary and sufficient conditions in constrained optimizationMathematical Programming, 1987
- What is invexity?The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1986
- Nondifferentiable optimization by smooth approximationsOptimization, 1986
- 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
- Continuity and Differentiability Properties of Convex OperatorsProceedings of the London Mathematical Society, 1982
- 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 optimality conditions in nondifferentiable programmingMathematical Programming, 1978