Fetching the paper…
Reading the bibliography…
We propose an inexact variable-metric proximal point algorithm to accelerate gradient-based optimization algorithms.
Fonctions convexes duales et points proximaux dans un espace hilbertien
J.-J. Moreau · 1962
Earlier work this paper cites.
A characterization of superlinear convergence and its application to quasi-newton methods
J. E. Dennis and J. J. Moré · 1974
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
R. T. Rockafellar · 1976
Earlier work this paper cites.
Updating quasi-Newton matrices with limited storage
J. Nocedal · 1980
Earlier work this paper cites.
Functional analysis
K. Yosida · 1980
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O O (1/ k 2 k^{2} )
Y. Nesterov · 1983
Earlier work this paper cites.
Global convergence of a case of quasi-Newton methods on convex problems
R. H. Byrd, J. Nocedal, and Y.-X. Yuan · 1987
Earlier work this paper cites.
On the limited memory BFGS method for large scale optimization
D. C. Liu and J. Nocedal · 1989
Earlier work this paper cites.
New proximal point algorithms for convex minimization
O. Güler · 1992
Earlier work this paper cites.
A globally and superlinearly convergent algorithm for nonsmooth convex minimization
M. Fukushima and L. Qi · 1996
Earlier work this paper cites.
Convex Analysis and Minimization Algorithms I
J.-B. Hiriart-Urruty and C. Lemaréchal · 1996
Earlier work this paper cites.
Convex analysis and minimization algorithms. II
J.-B. Hiriart-Urruty and C. Lemaréchal · 1996
Earlier work this paper cites.
A quasi-second-order proximal bundle algorithm
R. Mifflin · 1996
Earlier work this paper cites.
Practical aspects of the Moreau–Yosida regularization: Theoretical preliminaries
C. Lemaréchal and C. Sagastizábal · 1997
Earlier work this paper cites.
Proximal quasi-Newton methods for nondifferentiable convex optimization
X. Chen and M. Fukushima · 1999
Earlier work this paper cites.
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
J. Burke and M. Qian · 2000
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Y. Nesterov · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
Numerical Optimization: Theoretical and Practical Aspects
J.-F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizábal · 2006
Earlier work this paper cites.
Numerical optimization
J. Nocedal and S. Wright · 2006
Earlier work this paper cites.
Scalable training of L 1 L_{1} -regularized log-linear models
G. Andrew and J. Gao · 2007
Earlier work this paper cites.
A stochastic quasi-newton method for online convex optimization
N. N. Schraudolph, J. Yu, and S. Günter · 2007
Cited alongside, same era.
A quasi-Newton approach to non-smooth convex optimization
J. Yu, S. Vishwanathan, S. Günter, and N. N. Schraudolph · 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.
Sparse and Redundant Representations
M. Elad · 2010
Cited alongside, same era.
Sparse coding for machine learning, image processing and computer vision
J. Mairal · 2010
Cited alongside, same era.
Libsvm: a library for support vector machines
C. Chang and C. Lin · 2011
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
L. Xiao and T. Zhang · 2014
Later among the works it cites.
Convex Optimization Algorithms
D. P. Bertsekas · 2015
Later among the works it cites.
An inexact successive quadratic approximation method for L-1 regularized optimization
R. H. Byrd, J. Nocedal, and F. Oztoprak · 2015
Later among the works it cites.
Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
R. Frostig, R. Ge, S. M. Kakade, and A. Sidford · 2015
Later among the works it cites.
Generalized Uniformly Optimal Methods for Nonlinear Programming
S. Ghadimi, G. Lan, and H. Zhang · 2015
Later among the works it cites.
A universal catalyst for first-order optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Projected Newton-type methods in machine learning
M. Schmidt, D. Kim, and S. Sra · 2011
Cited alongside, same era.
Smoothing and first order methods: A unified framework
A. Beck and M. Teboulle · 2012
Cited alongside, same era.
A quasi-newton proximal splitting method
S. Becker and J. Fadili · 2012
Cited alongside, same era.
Sample size selection in optimization methods for machine learning
R. H. Byrd, G. M. Chin, J. Nocedal, and Y. Wu · 2012
Cited alongside, same era.
Randomized smoothing for stochastic optimization
J. C. Duchi, P. L. Bartlett, and M. J. Wainwright · 2012
Cited alongside, same era.
Hybrid deterministic-stochastic methods for data fitting
M. P. Friedlander and M. Schmidt · 2012
Cited alongside, same era.
H. Lin, J. Mairal, and Z. Harchaoui · 2015
Later among the works it cites.
Incremental majorization-minimization optimization with application to large-scale machine learning
J. Mairal · 2015
Later among the works it cites.
Global convergence of online limited memory bfgs
A. Mokhtari and A. Ribeiro · 2015
Later among the works it cites.
A stochastic quasi-Newton method for large-scale optimization
R. Byrd, S. Hansen, J. Nocedal, and Y. Singer · 2016
Closest in time.
Proximal quasi-newton methods for convex optimization
H. Ghanbari and K. Scheinberg · 2016
Closest in time.
Stochastic block BFGS: Squeezing more curvature out of data
R. M. Gower, D. Goldfarb, and P. Richtárik · 2016
Closest in time.
End-to-end kernel learning with supervised convolutional kernel networks
J. Mairal · 2016
Closest in time.
A linearly-convergent stochastic L-BFGS algorithm
P. Moritz, R. Nishihara, and M. I. Jordan · 2016
Closest in time.
Practical inexact proximal quasi-Newton method with global complexity analysis
K. Scheinberg and X. Tang · 2016
Closest in time.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Shwartz and T. Zhang · 2016
Closest in time.
An inexact subsampled proximal newton-type method for large-scale machine learning
X. Liu, C.-J. Hsieh, J. D. Lee, and Y. Sun · 2017
Closest in time.
Minimizing finite sums with the stochastic average gradient
M. Schmidt, N. L. Roux, and F. Bach · 2017
Closest in time.
Forward–backward quasi-newton methods for nonsmooth optimization problems
L. Stella, A. Themelis, and P. Patrinos · 2017
Closest in time.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
C. Cartis and K. Scheinberg · 2018
Closest in time.
Inexact successive quadratic approximation for regularized optimization
C. Lee and S. J. Wright · 2018
Closest in time.
Catalyst acceleration for first-order convex optimization: from theory to practice
H. Lin, J. Mairal, and Z. Harchaoui · 2018
Closest in time.