A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570): Difference between revisions
From MaRDI portal
Latest revision as of 22:11, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of subgradient-based methods for convex optimization problems in a unifying framework |
scientific article |
Statements
A family of subgradient-based methods for convex optimization problems in a unifying framework (English)
0 references
8 November 2016
0 references
non-smooth/smooth convex optimization
0 references
structured convex optimization
0 references
subgradient/gradient-based proximal method
0 references
mirror-descent method
0 references
dual-averaging method
0 references
complexity bounds
0 references
0 references
0 references