Fetching the paper…
Reading the bibliography…
This paper reveals that a common and central role, played in many error bound (EB) conditions and a variety of gradient-type methods, is a residual measure operator.
On approximate solutions of systems of linear inequalities
A. Hoffman · 1952
Earlier work this paper cites.
Une propriété topologique des sous-ensembles analytiques réels
S. Łojasiewicz · 1963
Earlier work this paper cites.
Gradient methods for the minimisation of functionals
B. T. Polyak · 1963
Earlier work this paper cites.
Convex analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
Asymptotic convergence of nonlinear contraction semigroups in Hilbert space
R. E. Bruck · 1975
Earlier work this paper cites.
On equiwellset minimum problems
T. Zolezzi · 1978
Earlier work this paper cites.
Some continuity properties of polyhedral multifunctions
S. M. Robinson · 1981
Earlier work this paper cites.
Asymptotic convergence analysis of the proximal point algorithm
F. Luque · 1984
Earlier work this paper cites.
On the linear convergence of descent methods for convex essentially smooth minimization
Z. Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Error bounds and convergence analysis of feasible descent methods: a general approach
Z. Q. Luo and P. Tseng · 1993
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S. J. Wright · 1997
Earlier work this paper cites.
Variational analysis
R. T. Rockafellar and R. J. B. Wets · 1998
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Nonlinear optimization
A. P. Ruszczyński · 2006
Earlier work this paper cites.
Fixed point continuation for
E. T. Hale, W. T. Yin, and Y. Zhang · 2008
Earlier work this paper cites.
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
H. Attouch and J. Bolte · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Implicit Functions and Solution Mappings
A. L. Dontchev and R. T. Rockafellar · 2009
Earlier work this paper cites.
Convex analysis and monotone operator theory in Hilbert spaces
H. H. Bauschke and P. L. Combettes · 2011
Earlier work this paper cites.
Convex optimization theory
D. P. Bertsekas · 2011
Earlier work this paper cites.
Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward–backward splitting, and regularized gauss–seidel methods
H. Attouch, J. Bolte, and B. F. Svaiter · 2013
Earlier work this paper cites.
Augmented
M. J. Lai and W. T. Yin · 2013
Earlier work this paper cites.
M. C. So · 2013
Earlier work this paper cites.
A proximal-gradient homotopy method for the sparse least-squares problem
L. Xiao and T. Zhang · 2013
Cited alongside, same era.
Gradient methods for convex minimization: Better rates under weaker conditions
H. Zhang and W. T. Yin · 2013
Cited alongside, same era.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
J. Bolte, S. Sabach, and M. Teboulle · 2014
Cited alongside, same era.
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Y. Drori and M. Teboulle · 2014
Cited alongside, same era.
Second-order growth, tilt stability, and metric regularity of the subdifferential
D. Drusvyatskiy, B. S. Mordukhovich, and T. T. A. Nghia · 2014
Cited alongside, same era.
Iteration complexity of feasible descent methods for convex optimization
Low-rank solutions of linear matrix equations via procrustes flow
S. Tu, R. Boczar, M. Simchowitz, and B. Recht · 2016
Closest in time.
A Lyapunov analysis of momentum methods in optimization
A. C. Wilson, B. Recht, and M. I. Jordan · 2016
Closest in time.
The physical systems behind optimization algorithms
L. Yang, R. Arora, V. Braverman, and T. Zhao · 2016
Closest in time.
New analysis of linear convergence of gradient-type methods via unifying error bound conditions
H. Zhang · 2016
Closest in time.
From error bounds to the complexity of first-order descent methods for convex functions
J. Bolte, T. P. Nguyen, J. Peypouquet, and B. W. Suter · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. W. Wang and C. J. Lin · 2014
Cited alongside, same era.
Metric subregularity of the convex subdifferential in Banach spaces
F. J. A. Artacho and M. H. Geoffroy · 2015
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
E. J. Cand · 2015
Cited alongside, same era.
Linear convergence of variance-reduced projected stochastic gradient without strong convexity
P. Gong and J. Ye · 2015
Cited alongside, same era.
Linear convergence of proximal-gradient methods under the Polyak-Łojasiewicz condition
H. Karimi and M. Schmidt · 2015
Cited alongside, same era.
Asynchronous stochastic coordinate descent: Parallelism and convergence properties
J. Liu and S. J. Wright · 2015
Cited alongside, same era.
Restricted strong convexity and its applications to convergence analysis of gradient-type methods
H. Zhang and L. Cheng · 2015
Cited alongside, same era.
Closest in time.
On the Q-linear convergence of forward-backward splitting method and uniqueness of optimal solution to Lasso
J. Cruz, G. Li, and T. Nghia · 2017
Closest in time.
Convergence of the forward-backward algorithm: Beyond the worst-case with the help of geometry
G. Garrigos, L. Rosasco, and S. Villa · 2017
Closest in time.
Iteration complexity analysis of block coordinate descent methods
M. Hong, X. Wang, M. Razaviyayn, and Z.-Q. Luo · 2017
Closest in time.
Calculus of the exponent of kurdyka-lojasiewicz inequality and its applications to linear convergence of first-order methods
G. Li and T. K. Pong · 2017
Closest in time.
On the estimation performance and convergence rate of the generalized power method for phase synchronization
H. Liu, M.-C. Yue, and A. M.-C. So · 2017
Closest in time.
D. R. Luke, N. H. Thao, and M. Teboulle · 2017
Closest in time.
Underestimate Sequences via Quadratic Averaging
C. X. Ma, N. V. Gudapati, M. Jahani, R. Tappenden, and M. Tak · 2017
Closest in time.
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
A. B. Taylor, J. M. Hendrickx, and F. Glineur · 2017
Closest in time.
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
A. B. Taylor, J. M. Hendrickx, and F. Glineur · 2017
Closest in time.
Global optimality conditions for deep neural networks
C. Yun, S. Sra, and A. Jadbabaie · 2017
Closest in time.
The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
H. Zhang · 2017
Closest in time.
Projected shrinkage algorithm for box-constrained
H. Zhang and L. Cheng · 2017
Closest in time.
Characterization of Gradient Dominance and Regularity Conditions for Neural Networks
Y. Zhou, and Y. Liang · 2017
Closest in time.
A unified approach to error bounds for structured convex optimization problems
Z. Zhou and M. C. So · 2017
Closest in time.
The rate of convergence of Nesterov’s accelerated forward-backard method is actually
H. Attouch and J. Peypouquet · 2018
Closest in time.
On the convergence of a regularized Jacobi algorithm for convex optimization
G. Banjac, K. Margellos, and P. J. Goulart · 2018
Closest in time.
Error bounds, quadratic growth, and linear convergence of proximal methods
D. Drusvyatskiy and A. S. Lewis · 2018
Closest in time.
Linear convergence of first order methods for non-strongly convex optimization
I. Necoara, Y. Nesterov, and F. Glineur · 2018
Closest in time.