Fetching the paper…
Reading the bibliography…
This work considers minimizing a sum of convex functions, each with potentially different structure ranging from nonsmooth to smooth, Lipschitz to non-Lipschitz.
Une propriété topologique des sous-ensembles analytiques réels
Stanislaw Lojasiewicz · 1963
Earlier work this paper cites.
Maximum likelihood from incomplete data via the em algorithm
A. P. Dempster, N. M. Laird, and D. B. Rubin · 1977
Earlier work this paper cites.
Recent studies on Lp-norm estimation
Hans Nyquist · 1980
Earlier work this paper cites.
The linear regression model: Lp norm estimation and the choice of p
Arthur Money, John F. Affleck-Graves, M. L. Hart, and G. D. I. Barr · 1982
Earlier work this paper cites.
Optimal methods of smooth convex minimization
A S Nemirovskii and Y E Nesterov · 1986
Earlier work this paper cites.
Double exponential families and their use in generalized linear regression
Bradley Efron · 1986
Earlier work this paper cites.
Sur la géométrie semi-et sous-analytique
Stanislas Łojasiewicz · 1993
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X. Goemans and David P. Williamson · 1995
Earlier work this paper cites.
The em algorithm–an old folk-song sung to a fast new tune
Xiao-Li Meng and David van Dyk · 1997
Earlier work this paper cites.
On gradients of functions definable in o-minimal structures
Krzysztof Kurdyka · 1998
Earlier work this paper cites.
Yossi Arjevani, Amit Daniely, Stefanie Jegelka, and Hongzhou Lin · 2002
Earlier work this paper cites.
Numerical Optimization
Jorge Nocedal and Stephen J. Wright · 2006
Earlier work this paper cites.
The łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems
Jérôme Bolte, Aris Daniilidis, and Adrian Lewis · 2007
Cited alongside, same era.
Dual averaging method for regularized stochastic learning and online optimization
Lin Xiao · 2009
Cited alongside, same era.
The university of florida sparse matrix collection
Timothy A. Davis and Yifan Hu · 2011
Cited alongside, same era.
Optimal regularized dual averaging methods for stochastic optimization
Xi Chen, Qihang Lin, and Javier Pena · 2012
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework
Saeed Ghadimi and Guanghui Lan · 2012
Cited alongside, same era.
A simpler approach to obtaining an o(1/t) convergence rate for the projected stochastic subgradient method
Convergence rates for deterministic and stochastic subgradient methods without lipschitz continuity
Benjamin Grimmer · 2019
Later among the works it cites.
Sharpness, restart, and acceleration
Vincent Roulet and Alexandre d’Aspremont · 2020
Later among the works it cites.
Sifting through the noise: Universal first-order methods for stochastic variational inequalities
Kimon Antonakopoulos, Thomas Pethick, Ali Kavis, Panayotis Mertikopoulos, and Volkan Cevher · 2021
Later among the works it cites.
An optimal-storage approach to semidefinite programming using approximate complementarity
Lijun Ding, Alp Yurtsever, Volkan Cevher, Joel A. Tropp, and Madeleine Udell · 2021
Later among the works it cites.
General hölder smooth convergence rates follow from specialized rates assuming growth bounds
Benjamin Grimmer · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Simon Lacoste-Julien, Mark Schmidt, and Francis R. Bach · 2012
Cited alongside, same era.
Critical sample size for the lp-norm estimator in linear regression models
Alejandro Llorente and Alberto Suárez · 2013
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Yurii Nesterov · 2015
Cited alongside, same era.
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
Guanghui Lan · 2015
Cited alongside, same era.
From error bounds to the complexity of first-order descent methods for convex functions
Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet, and Bruce W. Suter · 2017
Cited alongside, same era.
Rsg: Beating subgradient method without smoothness and strong convexity
Tianbao Yang and Qihang Lin · 2018
Cited alongside, same era.
A simple nearly optimal restart scheme for speeding up first-order methods
James Renegar and Benjamin Grimmer · 2022
Closest in time.
Super-universal regularized newton method, 2022
Nikita Doikov, Konstantin Mishchenko, and Yurii Nesterov · 2022
Closest in time.
Nuozhou Wang and Shuzhong Zhang · 2022
Closest in time.
Optimal convergence rates for the proximal bundle method
Mateo Díaz and Benjamin Grimmer · 2023
Closest in time.
https://www.csie.ntu.edu.tw/˜cjlin/libsvmtools/datasets/binary.html
Libsvm data: Classification (binary class) · 2023
Closest in time.
Some primal-dual theory for subgradient methods for strongly convex optimization, 2023
Benjamin Grimmer and Danlin Li · 2023
Closest in time.