Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-22T04:59:50.193Z Has data issue: false hasContentIssue false

Nonsmooth invexity

Published online by Cambridge University Press:  17 April 2009

Thomas W. Reiland
Affiliation:
Department of Statistics and Graduate Program in Operations Research, Box 8203, North Carolina State University, Raleigh, NC 27695-8203, United States of America
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.

The concept of invexity is extended to nondifferentiable functions. Characterisations of nonsmooth invexity are derived as well as results in unconstrained and constrained optimisation and duality. The principal analytic tool is the generalised gradient of Clarke for Lipschitz functions.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1990

References

[1]Ben-Israel, A. and Mond, B., ‘What is invexity?’, J. Austral. Math. Soc. Ser. B 28 (1986), 19.CrossRefGoogle Scholar
[2]Clarke, F.H., ‘Generalized gradients of Lipschitz functionala’, Adv. in Math. 40 (1981), 5267.CrossRefGoogle Scholar
[3]Clarke, F.H., Optimization and nonsmooth analysis (Wiley, New York, 1983).Google Scholar
[4]Craven, B.D., ‘Duality for generalized convex fractional programs’, in Generalized concavity in optimization and economics, Editors Schaible, S. and Ziemba, T., pp. 473490 (Academic Press, 1981).Google Scholar
[5]Craven, B.D., ‘Invex functions and constrained local minima’, Bull. Austral Math. Soc. 24 (1981), 357366.CrossRefGoogle Scholar
[6]Craven, B.D., ‘Nondifferentiable optimization by smooth approximations’, Optimization 17 (1986), 317.CrossRefGoogle Scholar
[7]Craven, B.D. and Glover, B.M., ‘Invex functions and duality’, J. Austral. Math. Soc. Series A 39 (1985), 120.CrossRefGoogle Scholar
[8]Egudo, R.R. and Mond, B., ‘Duality with generalized convexity’, J. Austral. Math. Soc. Ser. B 28 (1986), 1021.CrossRefGoogle Scholar
[9]Hanson, M.A., ‘On sufficiency of the Kuhn-Tucker conditions’, J. Math. Anal. Appl. 80 (1981), 545550.CrossRefGoogle Scholar
[10]Hanson, M.A. and Mond, B., ‘Further generalizations of convexity in mathematical programming’, J. Inform. Optim. Sci (1982), 2532.Google Scholar
[11]Hanson, M.A. and Mond, B., ‘Necessary and sufficient conditions in constrained optimization’, Math. Programming 37 (1987), 5158.CrossRefGoogle Scholar
[12]Hiriart-Urruty, J.B., ‘On optimality conditions in nondifferentiable programming’, Math. Prog. 14 (1978), 7386.CrossRefGoogle Scholar
[13]Hiriart-Urruty, J.B., ‘Refinements of necessary optimality conditions in nondifferentiable programming I’, Appl. Math. Optim. 5 (1979), 6382.CrossRefGoogle Scholar
[14]Jeyakumar, V., ‘Strong and weak invexity in mathematical programming’, Methods Oper. Res. 55 (1985), 109125.Google Scholar
[15]Martin, D.H., ‘The essence of invexity’, J. Optim. Theory Appl. 47 (1985), 6576.CrossRefGoogle Scholar
[16]Mifflin, R., ‘Semismooth and semiconvex functions in constrained optimization’, SIAM J. Control Optim. 15 (1977), 959972.CrossRefGoogle Scholar
[17]Mond, B. and Hanson, M.A., ‘On duality with generalized convexity’, Mathematische Operationsforschung und Statistik Series Optimization 15 (1984), 313317.CrossRefGoogle Scholar
[18]Mond, B. and Weir, T., ‘Generalized concavity and duality’, in Generalized Concavity in Optimization and Economics, Editors Schaible, S. and Ziemba, T., pp. 473490 (Academic Press, 1981).Google Scholar
[19]Reiland, T.W., ‘A geometric approach to nonsmooth optimization with sample applications’, Nonlinear Anal. 11 (1987), 11691184.CrossRefGoogle Scholar
[20]Stern, E.M., Singular Integrals and Differentiability Properties of Functions: Princeton Mathematics Series 30 (Princeton University Press, Princeton, New Jersey, 1970).Google Scholar