相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Lower bounds for finding stationary points II: first-order methods
Yair Carmon et al.
MATHEMATICAL PROGRAMMING (2021)
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution
Cong Ma et al.
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2020)
A Geometric Analysis of Phase Retrieval
Ju Sun et al.
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2018)
Optimization Methods for Large-Scale Machine Learning
Leon Bottou et al.
SIAM REVIEW (2018)
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
Gabor Braun et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2017)
STOCHASTIC FIRST- AND ZEROTH-ORDER METHODS FOR NONCONVEX STOCHASTIC PROGRAMMING
Saeed Ghadimi et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
Alekh Agarwal et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2012)
Complexity bounds for second-order optimality in unconstrained optimization
C. Cartis et al.
JOURNAL OF COMPLEXITY (2012)
Information-Based Complexity, Feedback and Dynamics in Convex Programming
Maxim Raginsky et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2011)
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)
Cubic regularization of Newton method and its global performance
Yurii Nesterov et al.
MATHEMATICAL PROGRAMMING (2006)
分享论文
