
doi: 10.2139/ssrn.885880
handle: 2078.1/4675
In many applications it is possible to justify a reasonable bound for possible variation of subgradients of objective function rather than for their uniform magnitude. In this paper we develop a new class of efficient primal-dual subgradient schemes for such problem classes.
Non-smooth optimization, Subgradient methods, convex optimization, subgradient methods, non-smooth optimization, blackbox methods, lower complexity bounds, Lower complexity bounds, Blackbox methods, Convex optimization
Non-smooth optimization, Subgradient methods, convex optimization, subgradient methods, non-smooth optimization, blackbox methods, lower complexity bounds, Lower complexity bounds, Blackbox methods, Convex optimization
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
