A family of subgradient-based methods for convex optimization problems in a unifying framework (Q2829570)
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 6648968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A family of subgradient-based methods for convex optimization problems in a unifying framework |
scientific article; zbMATH DE number 6648968 |
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
0.8223361968994141
0 references
0.7997269034385681
0 references
0.7713414430618286
0 references
0.7692975401878357
0 references
0.7450444102287292
0 references
