Fetching the paper…
Reading the bibliography…
In this paper, we extend the geometric descent method recently proposed by Bubeck, Lee and Singh to tackle nonsmooth and strongly convex composite problems.
Finding a zero by means of successive linear interpolation
T. J. Dekker · 1969
Earlier work this paper cites.
An algorithm with guaranteed convergence for finding a zero of a function
R. P. Brent · 1973
Earlier work this paper cites.
The ellipsoid method: A survey
R. G. Bland, D. Goldfarb, and M. J. Todd · 1981
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2})
Y. E. Nesterov · 1983
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. E. Nesterov · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
A. Beck · 2007
Earlier work this paper cites.
A minimax Chebyshev estimator for bounded error estimation
Y. C. Eldar, A. Beck, and M. Teboulle · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
Gradient methods for minimizing composite functions
Y. E. Nesterov · 2013
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
W. Su, S. Boyd, and E. J. Candès · 2014
Cited alongside, same era.
Fast first-order methods for composite convex optimization with backtracking
K. Scheinberg, D. Goldfarb, and X. Bai · 2014
Cited alongside, same era.
Proximal Newton-type methods for minimizing composite functions
Global convergence of damped semismooth Newton methods for L1 Tikhonov regularization
E. Hans and T. Raasch · 2015
Later among the works it cites.
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
H. Attouch, Z. Chbani, J. Peypouquet, and P. Redont · 2016
Closest in time.
Analysis and design of optimization algorithms via integral quadratic constraints
L. Lessard, B. Recht, and A. Packard · 2016
Closest in time.
A variational perspective on accelerated methods in optimization
A. Wibisono, A. Wilson, and M. I. Jordan · 2016
Closest in time.
Black-box optimization with a politician
S. Bubeck and Y.-T. Lee · 2016
Closest in time.
An optimal first order method based on optimal quadratic averaging
D. Drusvyatskiy, M. Fazel, and S. Roy · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. D. Lee, Y. Sun, and M. A. Saunders · 2014
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
S. Bubeck, Y.-T. Lee, and M. Singh · 2015
Cited alongside, same era.
Line search globalization of a semismooth Newton method for operator equations in Hilbert spaces with applications in optimal control
M. Gerdts, S. Horn, and S. Kimmerle · 2017
Closest in time.