Fetching the paper…
Reading the bibliography…
Our main goal in this paper is to show that one can skip gradient computations for gradient descent type methods applied to certain structured convex programming (CP) problems.
USSR computational mathematics and mathematical physics 7
Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming · 1967
Earlier work this paper cites.
Wiley-Interscience Series in Discrete Mathematics. John Wiley, XV (1983)
Nemirovski, A., Yudin, D.: Problem complexity and method efficiency in optimization · 1983
Earlier work this paper cites.
Doklady AN SSSR 269
Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) O(1/k^{2}) · 1983
Earlier work this paper cites.
Mathematics of Operations Research 28
Goldfarb, D., Iyengar, G.: Robust portfolio selection problems · 2003
Earlier work this paper cites.
Journal of Mathematical Imaging and Vision 20
Chambolle, A.: An algorithm for total variation minimization and applications · 2004
Earlier work this paper cites.
SIAM Journal on Optimization 15
Nemirovski, A.: Prox-method with rate of convergence O ( 1 / t ) {O}(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems · 2004
Earlier work this paper cites.
Kluwer Academic Publishers, Massachusetts (2004)
Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course · 2004
Earlier work this paper cites.
SIAM Journal on Optimization 16
Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization · 2005
Earlier work this paper cites.
Mathematical Programming 103
Nesterov, Y.E.: Smooth minimization of nonsmooth functions · 2005
Earlier work this paper cites.
SIAM Journal on Optimization 16
Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization · 2006
Earlier work this paper cites.
SIAM Journal on Optimization 19
d’Aspremont, A.: Smooth optimization with approximate gradient · 2008
Earlier work this paper cites.
submitted to SIAM Journal on Optimization (2008)
Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization · 2008
Cited alongside, same era.
UCLA CAM Report pp. 08–34 (2008)
Zhu, M., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration · 2008
Cited alongside, same era.
SIAM Journal on Imaging Sciences 3
Esser, E., Zhang, X., Chan, T.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science · 2010
Cited alongside, same era.
Mathematics of Operations Research 35
Hoda, S., Gilpin, A., Pena, J., Sandholm, T.: Smoothing techniques for computing nash equilibria of sequential games · 2010
Cited alongside, same era.
SIAM Journal on Imaging Sciences 4
Becker, S., Bobin, J., Candès, E.: NESTA: a fast and accurate first-order method for sparse recovery · 2011
Cited alongside, same era.
Journal of Mathematical Imaging and Vision 40
Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging · 2011
arXiv preprint arXiv:1311.1098 (2013)
He, N., Juditsky, A., Nemirovski, A.: Mirror prox algorithm for multi-term composite minimization and alternating directions · 2013
Later among the works it cites.
Optimization-online preprint (2013)
He, Y., Monteiro, R.D.: Accelerating block-decomposition first-order methods for solving generalized saddle-point and nash equilibrium problems · 2013
Later among the works it cites.
Mathematical Programming pp. 1–45 (2013)
Lan, G.: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization · 2013
Later among the works it cites.
SIAM Journal on Optimization 23
Monteiro, R.D., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers · 2013
Later among the works it cites.
In: Proceedings of the 30th International Conference on Machine Learning (ICML-13), pp. 80–88 (2013)
Ouyang, H., He, N., Tran, L., Gray, A.G.: Stochastic alternating direction method of multipliers · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Stochastic Systems 1
Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm · 2011
Cited alongside, same era.
Mathematical Programming 126
Lan, G., Lu, Z., Monteiro, R.D.: Primal-dual first-order methods with 𝒪 ( 1 / ε ) \mathcal{O}(1/\varepsilon) iteration-complexity for cone programming · 2011
Cited alongside, same era.
SIAM Journal on Optimization 22
Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization i: A generic algorithmic framework · 2012
Cited alongside, same era.
SIAM Journal on Imaging Sciences 5
He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective · 2012
Cited alongside, same era.
SIAM Journal on Numerical Analysis 50
He, B., Yuan, X.: On the O(1/n) convergence rate of the Douglas-Rdachford alternating direction method · 2012
Cited alongside, same era.
arXiv preprint arXiv:1403.4164 (2014)
Chen, Y., Lan, G., Ouyang, Y.: Accelerated schemes for a class of variational inequalities · 2014
Later among the works it cites.
SIAM Journal on Optimization 24
Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems · 2014
Later among the works it cites.
Submitted to SIAM Journal on Optimization (2014)
He, Y., Monteiro, R.D.: An accelerated hpe-type algorithm for a class of composite convex-concave saddle-point problems · 2014
Later among the works it cites.
Mathematical Programming pp. 1–35 (2015)
Lan, G.: Gradient sliding for composite optimization · 2015
Later among the works it cites.
SIAM Journal on Imaging Sciences 8
Ouyang, Y., Chen, Y., Lan, G., Eduardo Pasiliao, J.: An accelerated linearized alternating direction method of multipliers · 2015
Later among the works it cites.