Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization (Q2866204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization |
scientific article; zbMATH DE number 6238057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization |
scientific article; zbMATH DE number 6238057 |
Statements
13 December 2013
0 references
nonsmooth nonconvex optimization
0 references
smoothing approximation
0 references
quadratic regularization
0 references
convergence
0 references
worst-case complexity
0 references
stationary point
0 references
Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization (English)
0 references
