Optimization with nonsmooth data (Q1097840): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Methods of descent for nondifferentiable optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to the theory of nonsmooth optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks on the construction of higher order algorithms in convex optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3316093 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation to a set-valued mapping. I: A proposal / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simplex Method for Function Minimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4194749 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3703599 / rank | |||
Normal rank | |||
Latest revision as of 14:43, 18 June 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
