Quasi-monotone subgradient methods for nonsmooth convex minimization (Q2349846)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quasi-monotone subgradient methods for nonsmooth convex minimization |
scientific article |
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
