Fetching the paper…
Reading the bibliography…
We propose a primal-dual smoothing framework for finding a near-stationary point of a class of non-smooth non-convex optimization problems with max-structure.
1902
Earlier work this paper cites.
1903
Earlier work this paper cites.
1905
Earlier work this paper cites.
1906
Earlier work this paper cites.
Davis D, Grimmer B (2019) Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
1930
Earlier work this paper cites.
Sion M (1958) On general minimax theorems
1958
Earlier work this paper cites.
Danskin JM (1967)
1967
Earlier work this paper cites.
Rockafellar RT (1970)
1970
Earlier work this paper cites.
Nesterov Y (1983) A method of solving a convex programming problem with convergence rate
1983
Earlier work this paper cites.
Bernhard P, Rapaport A (1995) On a theorem of danskin with an application to a theorem of von neumann-sion
1995
Earlier work this paper cites.
Ben-Tal A, Margalit T, Nemirovski A (2001) The ordered subsets mirror descent optimization method with applications to tomography
2001
Earlier work this paper cites.
2002
Cited alongside, same era.
Kruger AY (2003) On fréchet subdifferentials
2003
Cited alongside, same era.
Nesterov Y (2004)
2004
Cited alongside, same era.
Zhang T (2004) Solving large scale linear prediction problems using stochastic gradient descent algorithms
2004
Cited alongside, same era.
Nemirovski A (2005) Prox-method with rate of convergence
2005
Cited alongside, same era.
Nesterov Y (2005) Smooth minimization of non-smooth functions
2005
Cited alongside, same era.
Nesterov Y (2013) Gradient methods for minimizing composite functions
2013
Later among the works it cites.
Devolder O, Glineur F, Nesterov Y (2014) First-order methods of smooth convex optimization with inexact oracle
2014
Later among the works it cites.
Chen Y, Chi Y, Goldsmith AJ (2015) Exact and stable covariance estimation from quadratic sampling via convex programming
2015
Later among the works it cites.
Peypouquet J (2015)
2015
Later among the works it cites.
Chen Y, Lan G, Ouyang Y (2017) Accelerated schemes for a class of variational inequalities
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Tseng P (2008) On accelerated proximal gradient methods for convex-concave optimization. Technical report, University of Washington, Seattle
2008
Cited alongside, same era.
Schmidt M, Roux NL, Bach FR (2011) Convergence rates of inexact proximal-gradient methods for convex optimization
2011
Cited alongside, same era.
Juditsky A, Nemirovski A (2012) First-order methods for nonsmooth convex large-scale optimization, I: General purpose methods
2012
Cited alongside, same era.
Candés E, Strohmer T, Voroninski V (2013) Phaselift: exact and stable signal recovery frommagnitude measurements via convex programming
2013
Cited alongside, same era.
Devolder O, Glineur F, Nesterov Y (2013) First-order methods with inexact oracle: the strongly convex case. CORE Discussion Paper (2013/16)
2013
Cited alongside, same era.
2017
Later among the works it cites.
Davis D, Drusvyatskiy D, MacPhee KJ (2018) Stochastic model-based minimization under high-order growth
2018
Later among the works it cites.
2018
Later among the works it cites.
Davis D, Drusvyatskiy D (2019) Stochastic model-based minimization of weakly convex functions
2019
Later among the works it cites.
Nouiehed M, Sanjabi M, Huang T, Lee JD, Razaviyayn M (2019) Solving a class of non-convex min-max games using iterative first order methods
2019
Later among the works it cites.
Thekumparampil KK, Jain P, Netrapalli P, Oh S (2019) Efficient algorithms for smooth minimax optimization
2019
Later among the works it cites.