Quasi-monotone subgradient methods for nonsmooth convex minimization (Q2349846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6446889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-monotone subgradient methods for nonsmooth convex minimization |
scientific article; zbMATH DE number 6446889 |
Statements
Quasi-monotone subgradient methods for nonsmooth convex minimization (English)
0 references
18 June 2015
0 references
The authors present new subgradient methods for solving nonsmooth convex minimization problems in a finite dimensional setting. It is shown that, by using special multiple averaging schemes, these methods generate convergent minimizing sequences. Applications to primal-dual problems and numerical experiments are provided.
0 references
convex optimization
0 references
nonsmooth optimization
0 references
subgradient methods
0 references
multiple averaging
0 references
rate of convergence
0 references
primal-dual methods
0 references
0.8364781141281128
0 references
0.8326327204704285
0 references
0.8304939270019531
0 references
0.8256776928901672
0 references
