Abstract
For a locally Lipschitz continuous function the generalized gradient of Clarke is used to develop some (set-valued) gradient on a set . Existence, uniqueness and some approximation are considered for optimal descent directions on set . The results serve as basis for nonsmooth numerical descent algorithms that can be found in subsequent papers.
References
- J. Aubin, I. Ekeland: Applied Nonlinear Analysis, Wiley, New York (1984).Google Scholar
- I. Cioranescu: Geometry of Banach Spaces, Duality Mappings and Nonlinear Problems, Kluwer, Dordrecht (1990).https://doi.org/10.1007/978-94-009-2121-4Google Scholar
- F. H. Clarke: Optimization and Nonsmooth Analysis, Wiley, New York (1983).Google Scholar
- F. H. Clarke: Functional Analysis, Calculus of Variations and Optimal Control, Springer, London (2013).https://doi.org/10.1007/978-1-4471-4820-3Google Scholar
- A. A. Goldstein: Optimization of Lipschitz continuous functions, Math. Programming 13 (1977) 14–22.https://doi.org/10.1007/BF01584320Google Scholar
- D. Werner: Funktionalanalysis, 5. Aufl., Springer, Berlin (2005).Google Scholar
Suggested citation
Published by Heldermann Verlag, 2019. Rights now held by Banach Press LLC.
