Optimization with nonsmooth data (Q1097840): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:31, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimization with nonsmooth data |
scientific article |
Statements
Optimization with nonsmooth data (English)
0 references
1987
0 references
We discuss where nonsmooth problems arise and why classical methods must fail in a nonsmooth context. Following this we present the main features of the two most successful approaches to nonsmooth problems, namely, the Subgradient methods and the Bundle methods.
0 references
nonsmooth problems
0 references
Subgradient methods
0 references
Bundle methods
0 references
