Oracle complexity of second-order methods for smooth convex optimization
Authors:
- 28 May 2018
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 178 (1-2) , 327-360
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric TensorsSIAM Journal on Matrix Analysis and Applications, 2015
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order MethodsSIAM Journal on Optimization, 2013
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimizationOptimization Methods and Software, 2012
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization ProblemsSIAM Journal on Optimization, 2010
- Accelerating the cubic regularization of Newton’s method on convex problemsMathematical Programming, 2007
- Cubic regularization of Newton method and its global performanceMathematical Programming, 2006
- Convex Optimization2004
- Introductory Lectures on Convex Optimization2004
- Interior-Point Polynomial Algorithms in Convex Programming1994