Hostname: page-component-848d4c4894-nr4z6 Total loading time: 0 Render date: 2024-06-01T16:59:36.149Z Has data issue: false hasContentIssue false
  • English
  • Français

On quasidifferentiable optimization

Published online by Cambridge University Press:  09 April 2009

B. D. Craven
B. D. Craven
Affiliation:
Mathematics Department, University of Melbourne, Parkville, Victoria, 3052, Australia
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.

Lagrangian necessary conditions for optimality, of both Fritz John and Kuhn Tucker types, are obtained for a constrained minimization problem, where the functions are locally Lipschitz and have directional derivatives, but need not have linear Gâteaux derivatives; the variable may be constrained to lie in a nonconvex set. The directional derivatives are assumed to have some convexity properties as functions of direction; this generalizes the concept of quasidifferentiable function. The convexity is not required when directional derivatives are replaced by Clarke generalized derivatives. Sufficient Kuhn Tucker conditions, and a criterion for the locally solvable constraint qualification, are obtained for directionally differentiable functions.

MSC classification

Secondary: 90C30: Nonlinear programming
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 41 , Issue 1 , August 1986 , pp. 64 - 78
Copyright
Copyright © Australian Mathematical Society 1986

References

[1]Berge, C., Topological spaces (Oliver and Boyd, Edingburgh and London, 1963).Google Scholar
[2]Clarke, F. H., ‘Generalized gradients of Lipschitz functionals,’ Adv. in Math. 40 (1981), 52–67.CrossRefGoogle Scholar
[3]Craven, B. D., ‘Lagrangean conditions and quasiduality,’ Bull. Austral. Math. Soc. 16 (1977), 325–339.CrossRefGoogle Scholar
[4]Craven, B. D., Mathematical programming and control theory (Chapman and Hall, London, 1978).CrossRefGoogle Scholar
[5]Craven, B. D., ‘Invex functions and constrained local minima,’ Bull. Austral. Math. Soc. 24 (1981), 357–366.CrossRefGoogle Scholar
[6]Craven, B. D., ‘Vector-valued optimization’ (in Generalized Concavity in Optimization and Economics, Schaible, S. and Ziemba, W. T. (eds.), Academic Press, New York, 1981, pp. 661–687).Google Scholar
[7]Craven, B. D. and Mond, B., ‘Lagrangean conditions for quasidifferentiable optimization’ (Survey of Mathematical Programming, Vol. 1, Prékopa, A. (ed), Akadémiai Kiadó, Budapest, and North-Holland, Amsterdam, 1979, pp. 177–192).Google Scholar
[8]Fan, Ky, ‘Minimax theorems,’ Proc. Nat. Acad. Sci. U.S.A. 39 (1953), 42–47.CrossRefGoogle ScholarPubMed
[9]Flett, T. M., Differential analysis (Cambridge Univ. Press., Cambridge, 1980).CrossRefGoogle Scholar
[10]Glover, B. M., ‘A generalized Farkas lemma with applications to quasidifferentiable programming’, Zeitschrift fur Operations Res. 26 (1982), 125–141.Google Scholar
[11]Hanson, Morgan A., ‘On sufficiency of the Kuhn Tucker conditions,’ J. Math. Anal. Appl. 80 (1981), 545–550.CrossRefGoogle Scholar
[12]Jameson, E., Ordered linear spaces, (Lecture Notes in Math. 141, Springer-Verlag, Berlin, 1970).CrossRefGoogle Scholar
[13]Mangasarian, O. L., Nonlinear programming (McGraw-Hill, New York, 1969).Google Scholar
[14]Nashed, M. Z., ‘Differentiability and related properties of nonlinear functional analysis’ (Nonlinear Functional Analysis and Applications, Rail, L. B. (ed), Academic Press, New York, 1971, pp. 103–310).CrossRefGoogle Scholar
[15]Pomerol, J. Ch., ‘Inequality system and minimax theorems, J. Math. Anal. Appl. 103 (1984), 262–292.CrossRefGoogle Scholar
[16]Pshenichnyi, P. N., Necessary conditions for an extremum (Marcel Dekker, New York, 1971).Google Scholar
[17]Robinson, S. M., ‘Stability theory for systems of inequalities; part II: differentiable nonlinear systems’, SIAMJ. Numer. Anal. 13 (1976), 497–513.CrossRefGoogle Scholar
[18]Rockafellar, R. T., Conjugate duality and optimization (Soc. Indust. Appl. Math., Philadelphia, 1974).CrossRefGoogle Scholar
[19]Rockafellar, R. T., ‘Generalized directional derivatives and subgradients of nonconvex functions’, Canad. J. Math. 32 (1980), 257–280.CrossRefGoogle Scholar
[20]Zalinescu, C., ‘A generalization of the Farkas lemmaand applications to convex programming’, J. Math. Anal. Appl. 66 (1978), 651–678.CrossRefGoogle Scholar