Fetching the paper…
Reading the bibliography…
We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization.
A general method of solving extremum problems
B. T. Polyak · 1967
Earlier work this paper cites.
Minimization methods for non-differentiable functions
N. Z. Shor, Krzysztof C. Kiwiel, and Andrzej Ruszcayǹski · 1985
Earlier work this paper cites.
Variational Analysis
R. Tyrrell Rockafellar and Roger J.-B. Wets · 1998
Earlier work this paper cites.
Incremental subgradient methods for nondifferentiable optimization
Angelia Nedic and Dimitri P. Bertsekas · 2001
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Yurii Nesterov · 2005
Earlier work this paper cites.
Computaiton of matrix norms with applications to robust optimization
Daureen Steinberg · 2005
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Earlier work this paper cites.
Dual averaging method for regularized stochastic learning and online optimization
Lin Xiao · 2009
Earlier work this paper cites.
Simon Lacoste-Julien, Mark Schmidt, and Francis R. Bach · 2012
Earlier work this paper cites.
Optimal regularized dual averaging methods for stochastic optimization
Xi Chen, Qihang Lin, and Javier Peña · 2012
Earlier work this paper cites.
Making gradient descent optimal for strongly convex stochastic optimization
Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan · 2012
Earlier work this paper cites.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
Ohad Shamir and Tong Zhang · 2013
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2014
Cited alongside, same era.
Reweighted l 2-regularized dual averaging approach for highly sparse stochastic learning
Vilen Jumutc and Johan A. K. Suykens · 2014
Cited alongside, same era.
Rsg: Beating subgradient method without smoothness and strong convexity
Tianbao Yang and Qihang Lin · 2015
Cited alongside, same era.
Randomized block subgradient methods for convex nonsmooth and stochastic optimization
Qi Deng, Guanghui Lan, and Anand Rangarajan · 2015
Cited alongside, same era.
Primal convergence from dual subgradient methods for convex optimization
E. Gustavsson, M. Patriksson, and AB Strömberg · 2015
Cited alongside, same era.
Radial subgradient method
Faster subgradient methods for functions with hölderian growth
Patrick R. Johnstone and Pierre Moulin · 2020
Later among the works it cites.
Accelerated dual-averaging primal–dual method for composite convex minimization
Conghui Tan, Yuqiu Qian, Shiqian Ma, and Tong Zhang · 2020
Later among the works it cites.
Algorithms for stochastic optimization with function or expectation constraints
Guanghui Lan and Zhiqiang Zhou · 2020
Later among the works it cites.
On Modification of an Adaptive Stochastic Mirror Descent Algorithm for Convex Optimization Problems with Functional Constraints
Mohammad S. Alkousa · 2020
Later among the works it cites.
Analogues of switching subgradient schemes for relatively lipschitz-continuous convex programming problems
Alexander A. Titov, Fedor S. Stonyakin, Mohammad S. Alkousa, Seydamet S. Ablaev, and Alexander V. Gasnikov · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Benjamin Grimmer · 2017
Cited alongside, same era.
"relative continuity" for non-lipschitz nonsmooth convex optimization using stochastic (or deterministic) mirror descent
Haihao Lu · 2017
Cited alongside, same era.
Convergence of first-order methods via the convex conjugate
Javier Peña · 2017
Cited alongside, same era.
Mirror Descent and Convex Optimization Problems with Non-smooth Inequality Constraints
Anastasia Bayandina, Pavel Dvurechensky, Alexander Gasnikov, Fedor Stonyakin, and Alexander Titov · 2018
Cited alongside, same era.
Convergence rates of proximal gradient methods via the convex conjugate
David Huckleberry Gutman and Javier F. Pena · 2018
Cited alongside, same era.
The approximate duality gap technique: A unified theory of first-order methods
Jelena Diakonikolas and Lorenzo Orecchia · 2019
Cited alongside, same era.
Convergence rates for deterministic and stochastic subgradient methods without lipschitz continuity
Benjamin Grimmer · 2019
Cited alongside, same era.
Primal-dual subgradient method for constrained convex optimization problems
M.R. Metel and A. Takeda · 2021
Later among the works it cites.
A simple nearly optimal restart scheme for speeding up first-order methods
James Renegar and Benjamin Grimmer · 2022
Later among the works it cites.
Perturbed fenchel duality and first-order methods
David H. Gutman and Javier F. Peña · 2022
Later among the works it cites.
Extended regularized dual averaging methods for stochastic optimization
Jonathan W. Siegel and Jinchao Xu · 2023
Closest in time.
Zhichao Jia and Benjamin Grimmer · 2023
Closest in time.
Yankun Huang and Qihang Lin · 2023
Closest in time.