Hostname: page-component-5d59c44645-lfgmx Total loading time: 0 Render date: 2024-03-01T01:01:15.475Z Has data issue: false hasContentIssue false

Sufficient conditions for invexity

Published online by Cambridge University Press:  17 April 2009

Nguyen Xuan Ha
Affiliation:
Institute of Cryptographic Technology, Hanoi, Vietnam
Do Van Luu
Affiliation:
Institute of Mathematics, PO Box 631 Bo Ho, 10000 Hanoi, Vietnam
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, we show that the Robinson, Nguyen–Strodiot–Mifflin and Jourani constraint qualifications are sufficient conditions for invexity of constrained functions with respect to the same scale function in Lipschitzian mathematical programmings. A Kuhn-Tucker necessary optimality condition is also given under the constraint qualification on the invexity property of constrained functions.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2003

References

[1]Clarke, F.H., Optimization and nonsmooth analysis, Canadian Math. Soc. Series of Monographs and Advanced Texts (J. Wiley & Sons, New York, 1983).Google Scholar
[2]Craven, B.D., ‘Invex function and constrained local minima’, Bull. Austral. Math. Soc. 24 (1981), 357366.CrossRefGoogle Scholar
[3]Craven, B.D., ‘Relations between invex properties’, World Sci. Ser. Appl. Anal. 5 (1995), 2534.Google Scholar
[4]Craven, B.D., Luu, D.V. and Glover, B.M., ‘Strengthened invex and perturbations’, Math. Methods Oper. Res. 43 (1996), 319336.CrossRefGoogle Scholar
[5]Girsanov, I.V., Lectures on mathematical theory of extremum problems (Springer-Verlag, Berlin, Heidelberg, 1972).CrossRefGoogle Scholar
[6]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker condition’, J. Math. Anal. Appl. 80 (1981), 545550.CrossRefGoogle Scholar
[7]Hanson, M.A. and Rueda, N.G., ‘A sufficient condition for invexity’, J. Math. Anal. Appl. 138 (1989), 193198.CrossRefGoogle Scholar
[8]Ha, N.X. and Luu, D.V., ‘Invexity of supremum and infimum functions’, Bull. Austral. Math. Soc. 65 (2002), 289306.CrossRefGoogle Scholar
[9]Jourani, A., ‘Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems’, J. Optim. Theory Appl. 81 (1994), 533548.CrossRefGoogle Scholar
[10]Kaul, R.N. and Kaur, S., ‘Optimality criteria in nonlinear programming involving nonconvex functions’, J. Math. Anal. Appl. 105 (1985), 104112.CrossRefGoogle Scholar
[11]Luu, D. V. and Ha, N.X., ‘An invariant property of invex functions and applications’, Acta Math. Vietnam. 25 (2000), 181193.Google Scholar
[12]Mangasarian, O.L. and Fromovitz, S., ‘The Fritz-John necessary optimality conditions in the presence of equality and inequality constraints’, J. Math. Anal. Appl. 17 (1967), 3747.CrossRefGoogle Scholar
[13]Nguyen, V.H., Strodiot, J.J. and Mifflin, R., ‘On conditions to have bounded multipliers in locally Lipschitz programming’, Math. Programming 18 (1980), 100106.CrossRefGoogle Scholar
[14]Reiland, T.W., ‘Nonsmooth invexity’, Bull. Austral. Math. Soc. 42 (1990), 437446.CrossRefGoogle Scholar
[15]Rockafellar, R.T., Convex analysis (Princeton University Press, Princeton, New Jersey, 1970).CrossRefGoogle Scholar
[16]Robinson, S.M., ‘Stability theory for systems of inequalities, Part II: Differentiable non-linear systems’, SIAM J. Numer. Anal. 13 (1976), 497513.CrossRefGoogle Scholar