On the complexity of the steepest-descent with exact linesearches
暂无分享,去创建一个
[1] Nicholas I. M. Gould,et al. Complexity bounds for second-order optimality in unconstrained optimization , 2012, J. Complex..
[2] Nicholas I. M. Gould,et al. On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems , 2010, SIAM J. Optim..
[3] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[4] Nicholas I. M. Gould,et al. Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2011, Math. Program..
[5] Yurii Nesterov,et al. Cubic regularization of Newton method and its global performance , 2006, Math. Program..
[6] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2008 .
[7] Florian Jarre,et al. On Nesterov's smooth Chebyshev–Rosenbrock function , 2013, Optim. Methods Softw..
[8] Luís Nunes Vicente,et al. Worst case complexity of direct search , 2013, EURO J. Comput. Optim..
[9] Serge Gratton,et al. Recursive Trust-Region Methods for Multiscale Nonlinear Optimization , 2008, SIAM J. Optim..
[10] Nicholas I. M. Gould,et al. A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function , 2013, Optim. Methods Softw..
[11] P. Toint,et al. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity , 2012 .
[12] Nicholas I. M. Gould,et al. On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization , 2012, SIAM J. Optim..