Fetching the paper…
Reading the bibliography…
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems.
Updating quasi-newton matrices with limited storage
J. Nocedal · 1980
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) O(1/k^{2})
Y. E. Nesterov · 1983
Earlier work this paper cites.
Representations of quasi-newton matrices and their use in limited memory methods
R. H. Byrd, J.Nocedal, and R. B. Schnabel · 1994
Earlier work this paper cites.
New variants of bundle methods
C. Lemaréchal, A. S. Nemirovski, and Y. E. Nesterov · 1995
Earlier work this paper cites.
Boosting algorithms as gradient descent in function space
L. Mason, J. Baxter, P. Bartlett, and M. Frean · 1999
Earlier work this paper cites.
Numerical optimization
J. Nocedal and S. J. Wright · 1999
Earlier work this paper cites.
Stochastic Simulation: Algorithm and Analysis
S. Asmussen and P. W. Glynn · 2000
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
J. Fan and R. Li · 2001
Earlier work this paper cites.
Optimization for simulation: Theory vs. practice
M. Fu · 2002
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: a basic course
Y. E. Nesterov · 2004
Earlier work this paper cites.
Non-Euclidean restricted memory level method for large-scale convex optimization
A. Ben-Tal and A. S. Nemirovski · 2005
Cited alongside, same era.
Simulation Modeling and Analysis
A. M. Law · 2007
Cited alongside, same era.
On accelerated proximal gradient methods for convex-concave optimization
P. Tseng · 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.
Online dictionary learning for sparse coding
J. Mairal, F. Bach, J. Ponce, and G. Sapiro · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. S. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms
S. Ghadimi and G. Lan · 2013
Later among the works it cites.
The complexity of large-scale convex programming under a linear optimization oracle
G. Lan · 2013
Later among the works it cites.
Gradient methods for minimizing composite objective functions
Y. E. Nesterov · 2013
Later among the works it cites.
Fast bundle-level type methods for unconstrained and ball-constrained convex optimization
Y. chen, G. Lan, Y. Ouyang, and W. Zhang · 2014
Later among the works it cites.
Mini-batch stochastic approximation methods for constrained nonconvex stochastic programming
S. Ghadimi, G. Lan, and H. Zhang · 2014
Later among the works it cites.
Universal gradient methods for convex optimization problems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the complexity of steepest descent, newton’s and regularized newton’s methods for nonconvex unconstrained optimization
C. Cartis, N. I. M. Gould, and Ph. L. Toint · 2010
Cited alongside, same era.
First-order methods of smooth convex optimization with inexact oracle
O.Devolder, F.Glineur, and Y. E. Nesterov · 2010
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework
S. Ghadimi and G. Lan · 2012
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Cited alongside, same era.
Y. E. Nesterov · 2014
Later among the works it cites.
Accelerated gradient methods for nonconvex nonlinear and stochastic optimization
S. Ghadimi and G. Lan · 2015
Closest in time.
Projection on a polyhedron that exploits sparsity
W. W. Hager and H. Zhang · 2015
Closest in time.
Bundle-level type methods uniformly optimal for smooth and non-smooth convex optimization
G. Lan · 2015
Closest in time.
M. Yashtini · 2015
Closest in time.