Fetching the paper…
Reading the bibliography…
The {\L}ojasiewicz inequality shows that sharpness bounds on the minimum of convex optimization problems hold almost generically.
Hoffman, A. J. [1952], ‘On approximate solutions of systems of linear inequalities’, Journal of Research of the National Bureau of Standards
1952
Earlier work this paper cites.
Łojasiewicz, S. [1963], ‘Une propriété topologique des sous-ensembles analytiques réels’, Les équations aux dérivées partielles
1963
Earlier work this paper cites.
Polyak, B. T. [1963], ‘Gradient methods for minimizing functionals’, Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki
1963
Earlier work this paper cites.
Robinson, S. M. [1975], ‘An application of error bounds for convex programming in a linear space’, SIAM Journal on Control
1975
Earlier work this paper cites.
Nesterov, Y. [1983], ‘A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) {O}(1/k^{2}) ’, Soviet Mathematics Doklady
1983
Earlier work this paper cites.
Mangasarian, O. L. [1985], ‘A condition number for differentiable convex inequalities’, Mathematics of Operations Research
1985
Earlier work this paper cites.
Nemirovskii, A. and Nesterov, Y. [1985], ‘Optimal methods of smooth convex minimization’, USSR Computational Mathematics and Mathematical Physics
1985
Earlier work this paper cites.
Auslender, A. and Crouzeix, J.-P. [1988], ‘Global regularity theorems’, Mathematics of Operations Research
1988
Earlier work this paper cites.
Bierstone, E. and Milman, P. D. [1988], ‘Semianalytic and subanalytic sets’, Publications Mathématiques de l’IHÉS
1988
Earlier work this paper cites.
Burke, J. and Ferris, M. C. [1993], ‘Weak sharp minima in mathematical programming’, SIAM Journal on Control and Optimization
1993
Earlier work this paper cites.
Łojasiewicz, S. [1993], ‘Sur la géométrie semi-et sous-analytique’, Annales de l’institut Fourier
1993
Earlier work this paper cites.
Burke, J. and Deng, S. [2002], ‘Weak sharp minima revisited part i: basic theory’, Control and Cybernetics
2002
Earlier work this paper cites.
Nesterov, Y. [2005], ‘Smooth minimization of non-smooth functions’, Mathematical programming
2005
Earlier work this paper cites.
Asuncion, A. and Newman, D. [2007], ‘UCI machine learning repository’
2007
Earlier work this paper cites.
Bolte, J., Daniilidis, A. and Lewis, A. [2007], ‘The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems’, SIAM Journal on Optimization
2007
Earlier work this paper cites.
Tseng, P. [2008], On accelerated proximal gradient methods for convex-concave optimization, Technical report, University of Washington
2008
Cited alongside, same era.
Attouch, H., Bolte, J., Redont, P. and Soubeyran, A. [2010], ‘Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality’, Mathematics of Operations Research
2010
Cited alongside, same era.
Beck, A. and Teboulle, M. [2012], ‘Smoothing and first order methods: A unified framework’, SIAM Journal on Optimization
2012
Cited alongside, same era.
Gilpin, A., Pena, J. and Sandholm, T. [2012], ‘First-order algorithm with 𝒪 ( log 1 / ϵ ) \mathcal{O}(\log 1/\epsilon) convergence for ϵ \epsilon -equilibrium in two-person zero-sum games’, Mathematical programming
2012
Cited alongside, same era.
Nesterov, Y. [2013 a
2013
Zhou, Z., Zhang, Q. and So, A. M.-C. [2015], ℓ 1 , p \ell_{1,p} -norm regularization: error bounds and convergence rate analysis of first-order methods, in
2015
Later among the works it cites.
Arjevani, Y. and Shamir, O. [2016], On the iteration complexity of oblivious first-order optimization algorithms, in
2016
Later among the works it cites.
Bauschke, H. H., Bolte, J. and Teboulle, M. [2016], ‘A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications’, Mathematics of Operations Research
2016
Later among the works it cites.
2016
Later among the works it cites.
Karimi, H., Nutini, J. and Schmidt, M. [2016], Linear convergence of gradient and proximal-gradient methods under the Polyak-Łojasiewicz condition, in
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Nesterov, Y. [2013 b
2013
Cited alongside, same era.
Bolte, J., Sabach, S. and Teboulle, M. [2014], ‘Proximal alternating linearized minimization for nonconvex and nonsmooth problems’, Mathematical Programming
2014
Cited alongside, same era.
Giselsson, P. and Boyd, S. [2014], Monotonicity and restart in fast gradient methods, in
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Lin, Q. and Xiao, L. [2014], An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization, in
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Su, W., Boyd, S. and Candes, E. [2014], A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights, in
2014
Cited alongside, same era.
2016
Later among the works it cites.
Bolte, J., Nguyen, T. P., Peypouquet, J. and Suter, B. W. [2017], ‘From error bounds to the complexity of first-order descent methods for convex functions’, Mathematical Programming
2017
Closest in time.
Liu, M. and Yang, T. [2017], Adaptive accelerated gradient converging method under hölderian error bound condition, in
2017
Closest in time.
Drusvyatskiy, D. and Lewis, A. S. [2018], ‘Error bounds, quadratic growth, and linear convergence of proximal methods’, Mathematics of Operations Research
2018
Closest in time.
Freund, R. M. and Lu, H. [2018], ‘New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure’, Mathematical Programming
2018
Closest in time.
Lu, H., Freund, R. M. and Nesterov, Y. [2018], ‘Relatively smooth convex optimization by first-order methods, and applications’, SIAM Journal on Optimization
2018
Closest in time.
Long version
Pillutla, K., Roulet, V., Kakade, S. M. and Harchaoui, Z. [2018], A smoother way to train structured prediction models, in · 2018
Closest in time.
2018
Closest in time.
Fercoq, O. and Qu, Z. [2019], ‘Adaptive restart of accelerated gradient methods under local quadratic growth condition’, IMA Journal of Numerical Analysis
2019
Closest in time.
Kerdreux, T., d’Aspremont, A. and Pokutta, S. [2019], Restarting frank-wolfe, in
2019
Closest in time.
Roulet, V., Boumal, N. and d’Aspremont, A. [2019], ‘Computational complexity versus statistical performance on sparse recovery problems’, Information and Inference: A Journal of the IMA
2019
Closest in time.