Calculus of variations and optimal control; optimization Nonsmooth analysis and set-valued analysis Concept
Clarke generalized gradient
Summary
The Clarke generalized gradient is a set of generalized derivatives of a locally Lipschitz function at a point. It extends both the gradient of a continuously differentiable function and the subdifferential of a convex function. It is always a nonempty, convex and weak-* compact set, and it contains at every local minimum and every local maximum. Frank Clarke introduced it as the basis of nonsmooth analysis and of optimality conditions for problems without smoothness. The definition gives the precise construction.
Further reading
About this page
| Tag | 20967BXZKA |
|---|---|
| URI | m2://20967BXZKA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 49J52, 26B25 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.