Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-28T02:06:47.475Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalized Gradients, Lipschitz behavior and Directional Derivatives

Published online by Cambridge University Press:  20 November 2018

Jay S. Treiman
Jay S. Treiman*
Affiliation:
Western Michigan University, Kalamazoo, Michigan
Rights & Permissions [Opens in a new window]

Extract

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 the study of optimization problems it is necessary to consider functions that are not differentiable. This has led to the consideration of generalized gradients and a corresponding calculus for certain classes of functions. Rockafellar [16] and others have developed a very strong and elegant theory of subgradients for convex functions. This convex theory gives point-wise criteria for the existence of extrema in optimization problems.

There are however many optimization problems that involve functions which are neither differentiable nor convex. Such functions arise in many settings including optimal value functions [15]. In order to deal with such problems Clarke [3] defined a type of subgradient for nonconvex functions. This definition was initially for Lipschitz functions on R”. Clarke extended this definition to include lower semicontinuous (l.s.c.) functions on Banach spaces through the use of a directional derivative, the distance function from a closed set and tangent and normal cones to closed sets.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 37 , Issue 6 , 01 December 1985 , pp. 1074 - 1084
Copyright
Copyright © Canadian Mathematical Society 1985

References

1. Aubin, J. P., Locally Lipschitz cooperative games, J. Math. Econom. 8 (1981), 241–262.Google Scholar
2. Bishop, E. and Phelps, R. R., The support functionals of a convex set, in Convexity, Proc. Symp. Pure Math. 7, 27–35.Google Scholar
3. Clarke, F. H., Generalized gradients and applications, Trans. Am. Math. Soc. 205 (1975), 247–262.Google Scholar
4. Clarke, F. H., A new approach to Lagrange multipliers, Math. Oper. Res. 1 (1976), 165–174.Google Scholar
5. Clarke, F. H., Generalized gradients of Lipschitz functionals, Adv. in Math. 40 (1981), 52–67.Google Scholar
6. Clarke, F. H., Optimization and nonsmooth analysis (Wiley Interscience, New York, 1983).Google Scholar
7. Cornet, B., Regular properties of tangent and normal cones, to appear.Google Scholar
8. Ekeland, I., On the variational principle, J. Math. Anal. Appl. 47 (1974), 324–353.Google Scholar
9. Hiriart-Urruty, J. B., Conditions nécessaires d'optimalite pour un programme stochastique avec recours, SIAM J. Control and Opt. 16 (1978), 317–329.Google Scholar
10. Klee, V. L., Convex sets in linear spaces, Duke Math. J. 18 (1951), 443–465.Google Scholar
11. Penot, J. P., A characterization of tangential regularity, Nonlinear Analysis 5 (1981), 625–643.Google Scholar
12. Rockafellar, R. T., Directionally Lipschitz functions and subdifferential calculus, Proc. London Math. Soc. (3) 39 (1979), 331–335.Google Scholar
13. Rockafellar, R. T., Clarke's tangent cones and boundaries of closed sets in Rn, Nonlinear Analysis 3 (1979), 145–154.Google Scholar
14. Rockafellar, R. T., Generalized directional derivatives and subgradients of nonconvex functions, Can. J. Math. 32 (1980), 257–280.Google Scholar
15. Rockafellar, R. T., Proximal subgradients, marginal values and augmented Lagrangians in nonconvex optimization, Math. Oper. Res. 6 (1981), 424–436.Google Scholar
16. Rockafellar, R. T., Convex analysis (Princeton University Press, 1970).CrossRefGoogle Scholar
17. Treiman, J. S., Characterization of Clarke's tangent and normal cones infinite and infinite dimensions, Nonlinear Analysis 7 (1983), 771–783.Google Scholar