Related references
Note: Only part of the references are listed.Complexity of unconstrained minimization
Xiaojun Chen et al.
MATHEMATICAL PROGRAMMING (2014)
Gradient methods for minimizing composite functions
Yu Nesterov
MATHEMATICAL PROGRAMMING (2013)
Iteration-complexity of first-order penalty methods for convex programming
Guanghui Lan et al.
MATHEMATICAL PROGRAMMING (2013)
STOCHASTIC FIRST- AND ZEROTH-ORDER METHODS FOR NONCONVEX STOCHASTIC PROGRAMMING
Saeed Ghadimi et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
OPTIMAL STOCHASTIC APPROXIMATION ALGORITHMS FOR STRONGLY CONVEX STOCHASTIC COMPOSITE OPTIMIZATION, II: SHRINKING PROCEDURES AND OPTIMAL ALGORITHMS
Saeed Ghadimi et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
An optimal method for stochastic composite optimization
Guanghui Lan
MATHEMATICAL PROGRAMMING (2012)
OPTIMAL STOCHASTIC APPROXIMATION ALGORITHMS FOR STRONGLY CONVEX STOCHASTIC COMPOSITE OPTIMIZATION I: A GENERIC ALGORITHMIC FRAMEWORK
Saeed Ghadimi et al.
SIAM JOURNAL ON OPTIMIZATION (2012)
ON THE COMPLEXITY OF STEEPEST DESCENT, NEWTON'S AND REGULARIZED NEWTON'S METHODS FOR NONCONVEX UNCONSTRAINED OPTIMIZATION PROBLEMS
C. Cartis et al.
SIAM JOURNAL ON OPTIMIZATION (2010)
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Amir Beck et al.
SIAM JOURNAL ON IMAGING SCIENCES (2009)
ROBUST STOCHASTIC APPROXIMATION APPROACH TO STOCHASTIC PROGRAMMING
A. Nemirovski et al.
SIAM JOURNAL ON OPTIMIZATION (2009)
Recursive trust-region methods for multiscale nonlinear optimization
Serge Gratton et al.
SIAM JOURNAL ON OPTIMIZATION (2008)
Smooth minimization of non-smooth functions
Y Nesterov
MATHEMATICAL PROGRAMMING (2005)
Optimization for simulation: Theory vs. practice
MC Fu
INFORMS JOURNAL ON COMPUTING (2002)
Variable selection via nonconcave penalized likelihood and its oracle properties
JQ Fan et al.
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION (2001)
Share Paper
