Gradients on sets
From MaRDI portal
Publication:5208215
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.
Recommendations
- Generalized gradients and paths of descent
- scientific article; zbMATH DE number 940912
- On Generalized Gradients in Optimization Problems with Set-Valued Constraints
- On the convergence of Clarke's generalized gradient method in minimization problems of Lipschitz functions
- Generalized Gradients, Lipschitz behavior and Directional Derivatives
Cites work
Cited in
(6)- Slope intervals, generalized gradients, semigradients, slant derivatives, and csets
- Generalized gradients and paths of descent
- scientific article; zbMATH DE number 4100029 (Why is no real title available?)
- scientific article; zbMATH DE number 1421094 (Why is no real title available?)
- Descent modulus and applications
- A descent method for nonsmooth multiobjective optimization in Hilbert spaces
This page was built for publication: Gradients on sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208215)