Hostname: page-component-7f64f4797f-n5rmq Total loading time: 0 Render date: 2025-11-04T11:49:00.037Z Has data issue: false hasContentIssue false
  • English
  • Français

Invexity criteria for a class of vector-valued functions

Published online by Cambridge University Press:  17 April 2009

Pham Huu Sach  and
Ta Duy Phuong
Pham Huu Sach
Affiliation:
Hanoi Institute of MathematicsPO Box 631Boho, HanoiVietnam
Ta Duy Phuong
Affiliation:
Hanoi Institute of MathematicsPO Box 631Boho, HanoiVietnam
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.

This paper gives criteria, necessary or sufficient for a vector-valued function F = (f1, f2, …, fk) to be invex. Here each fi is of the -class (that is, each fi is a function whose gradient mapping is locally Lipschitz in a neighbourhood of x0) and the invexity of F means that F(x) − F(x0) ⊂ ˚F′(X) + Q for a fixed convex cone Q of Rk and every x near x0 (˚F′ being the Jacobian matrix of F at x0).

Information

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 51 , Issue 2 , April 1995 , pp. 249 - 262
Copyright
Copyright © Australian Mathematical Society 1995

References

[1]Ben-Israel, A. and Mond, B., ‘What is invexity’, J. Austral. Math. Soc. Ser. B 28 (1986), 1–9.CrossRefGoogle Scholar
[2]Craven, B.D., ‘Invex functions and constrained local minima’, Bull. Austral. Math. Soc. 24 (1981), 357–366.CrossRefGoogle Scholar
[3]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker conditions’, J. Math. Anal. Appl. 80 (1981), 545–550.CrossRefGoogle Scholar
[4]Hanson, M.A. and Rueda, N.G., ‘A sufficient condition for invexity’, J. Math. Anal. Appl. 138 (1989), 193–198.CrossRefGoogle Scholar
[5]Hiriart-Urruty, J.B., Strodiot, J.J. and Nguyen, V.H., ‘Generalized Hessian matrix and second-order optimality conditions for problems with C 11 data’, Appl. Math. Optim. 11 (1984), 43–56.CrossRefGoogle Scholar
[6]Jeyakumar, V., ‘Strong and weak invexity in mathematical programming’, Methods Oper. Res. 55 (1985), 109–125.Google Scholar
[7]Reiland, T.W., ‘Generalized invexity for nonsmooth vector-valued mappings.’, Numer. Funct. Anal. Optim. 10 (1989), 1191–1202.CrossRefGoogle Scholar
[8]Rockafellar, R.T., Convex Analysis (Princeton University Press, Princeton, 1970).CrossRefGoogle Scholar
[9]Sach, P.H. and Craven, B.D., ‘Invexity in multifunction optimization’, Numer. Funct. Anal. Optim. 12 (1991), 383–394.CrossRefGoogle Scholar
[10]Sach, P.H. and Craven, B.D., ‘Invex multifunctions and duality’, Numer. Funct. Anal. Optim. 12 (1991), 575–591.CrossRefGoogle Scholar
[11]Wolfe, P., ‘A duality theorem for nonlinear programming’, Quart. Appl. Math. 19 (1961), 239–244.CrossRefGoogle Scholar
[12]Yen, N.D. and Sach, P.H., ‘On locally Lipschitz vector-valued invex functions’, Bull. Austral. Math. Soc. 47 (1993), 259–272.CrossRefGoogle Scholar