Fetching the paper…
Reading the bibliography…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization.
SIAM Journal on Scientific and Statistical Computing 4
Moré, J.J., Sorensen, D.C.: Computing a trust region step · 1983
Earlier work this paper cites.
John Wiley and Sons (1987)
Fletcher, R.: Practical Methods of Optimization · 1987
Earlier work this paper cites.
SIAM Journal on Numerical Analysis 25
Conn, A.R., Gould, N.I.M., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds · 1988
Earlier work this paper cites.
Mathematical programming 45
Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization · 1989
Earlier work this paper cites.
Mathematical Programming 47
Burke, J.V., Moré, J.J., Toraldo, G.: Convergence properties of trust region methods for linear and convex constraints · 1990
Earlier work this paper cites.
SIAM Journal on Scientific Computing 16
Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization · 1995
Earlier work this paper cites.
SIAM Journal on Optimization 9
Lin, C.J., Moré, J.J.: Newton’s method for large-scale bound constrained problems · 1999
Earlier work this paper cites.
SIAM Journal on Optimization 11
Li, D.H., Fukushima, M.: On the global convergence of the BFGS method for nonconvex unconstrained optimization problems · 2001
Earlier work this paper cites.
Kluwer Academic Publishers (2004)
Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course · 2004
Earlier work this paper cites.
Multiscale Modeling and Simulation 4
Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting · 2005
Earlier work this paper cites.
Springer (2006)
Nocedal, J., Wright, S.J.: Numerical optimization, second edn · 2006
Earlier work this paper cites.
Mathematical Programming 117
Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization · 2009
Earlier work this paper cites.
IEEE Transactions on Signal Processing 57
Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation · 2009
Cited alongside, same era.
In: Advances in Neural Information Processing Systems, pp. 1458–1466 (2011)
Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization · 2011
Cited alongside, same era.
SIAM Journal on Optimization 22
Jiang, K., Sun, D., Toh, K.C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex sdp · 2012
Cited alongside, same era.
Mathematical Programming 140
Nesterov, Y.: Gradient methods for minimizing composite functions · 2013
Cited alongside, same era.
SIAM Journal on Optimization 23
Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward-backward algorithms · 2013
Cited alongside, same era.
In: Advances in Neural Information Processing Systems, pp. 629–637 (2013)
Yang, T.: Trading computation for communication: Distributed stochastic dual coordinate ascent · 2013
Mathematical Programming 157
Byrd, R.H., Nocedal, J., Oztoprak, F.: An inexact successive quadratic approximation method for L − 1 {L}-1 regularized optimization · 2016
Later among the works it cites.
In: Proceedings of the International Conference on Machine Learning, pp. 2597–2605 (2016)
Rodomanov, A., Kropotov, D.: A superlinearly-convergent proximal Newton-type method for the optimization of finite sums · 2016
Later among the works it cites.
Mathematical Programming 160
Scheinberg, K., Tang, X.: Practical inexact proximal quasi-Newton method with global complexity analysis · 2016
Later among the works it cites.
Inverse Problems 33
Bonettini, S., Loris, I., Porta, F., Prato, M., Rebegoldi, S.: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization · 2017
Later among the works it cites.
Tech. rep. (2017)
Lee, C.p., Chang, K.W.: Distributed block-diagonal approximation methods for regularized empirical risk minimization · 2017
Later among the works it cites.
Mathematical Methods of Operations Research 85
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Journal of Optimization Theory and Applications 162
Chouzenoux, E., Pesquet, J.C., Repetti, A.: Variable metric forward–backward algorithm for minimizing the sum of a differentiable function and a convex function · 2014
Cited alongside, same era.
SIAM Journal on Optimization 24
Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions · 2014
Cited alongside, same era.
SIAM Journal on Optimization 24
Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization · 2014
Cited alongside, same era.
SIAM Journal on Optimization 25
Bach, F.: Duality between subgradient and conditional gradient methods · 2015
Cited alongside, same era.
In: Proceedings of the International Conference on Machine Learning (2015)
Lee, C.p., Roth, D.: Distributed box-constrained quadratic optimization for dual linear SVM · 2015
Cited alongside, same era.
SIAM Journal on Optimization 26
Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization · 2016
Cited alongside, same era.
Li, J., Andersen, M.S., Vandenberghe, L.: Inexact proximal Newton methods for self-concordant functions · 2017
Later among the works it cites.
Journal of Machine Learning Research 18
Zheng, S., Wang, J., Xia, F., Xu, W., Zhang, T.: A general distributed dual coordinate optimization framework for regularized loss minimization · 2017
Later among the works it cites.
Mathematics of Operations Research (2018)
Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods · 2018
Closest in time.
Computational Optimization and Applications 69
Ghanbari, H., Scheinberg, K.: Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates · 2018
Closest in time.
In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1646–1655. ACM, New York, NY, USA (2018)
Lee, C.p., Lim, C.H., Wright, S.J.: A distributed quasi-Newton algorithm for empirical risk minimization with nonsmooth regularization · 2018
Closest in time.
Journal of Machine Learning Research 18
Lin, H., Mairal, J., Harchaoui, Z.: Catalyst acceleration for first-order convex optimization: from theory to practice · 2018
Closest in time.
Mathematical Programming pp. 1–39 (2018)
Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization · 2018
Closest in time.