Relating Lexicographic Smoothness and Directed Subdifferentiability
- Argonne National Lab. (ANL), Argonne, IL (United States)
Lexicographic derivatives developed by Nesterov and directed subdifferentials developed by Baier, Farkhi, and Roshchina are both essentially nonconvex generalized derivatives for nonsmooth nonconvex functions and satisfy strict calculus rules and mean-value theorems. This article aims to clarify the relationship between the two generalized derivatives. In particular, for scalar-valued functions that are locally Lipschitz continuous, lexicographic smoothness and directed subdifferentiability are shown to be equivalent, along with the necessary optimality conditions corresponding to each. For such functions, the visualization of the directed subdifferential-the Rubinov subdifferential-is shown to include the lexicographic subdifferential, and is also shown to be included in its closed convex hull. As a result, various implications of these results are discussed.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- Grant/Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1373756
- Journal Information:
- Set-valued and Variational Analysis, Journal Name: Set-valued and Variational Analysis Journal Issue: 2 Vol. 25; ISSN 1877-0533
- Publisher:
- SpringerCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Computationally relevant generalized derivatives: theory, evaluation and applications
|
journal | September 2017 |
Similar Records
Eigenvalue optimization and subdifferentials
Subdifferential monotonicity as characterization of convex functions