On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
暂无分享,去创建一个
[1] John L. Nazareth,et al. Introduction to derivative-free optimization , 2010, Math. Comput..
[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] John E. Dennis,et al. Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.
[4] Stephen A. Vavasis,et al. Approximation algorithms for indefinite quadratic programming , 1992, Math. Program..
[5] Yurii Nesterov,et al. Accelerating the cubic regularization of Newton’s method on convex problems , 2005, Math. Program..
[6] Yurii Nesterov,et al. Cubic regularization of Newton method and its global performance , 2006, Math. Program..
[7] Serge Gratton,et al. Recursive Trust-Region Methods for Multiscale Nonlinear Optimization , 2008, SIAM J. Optim..
[8] Andreas Griewank,et al. On the unconstrained optimization of partially separable functions , 1982 .
[9] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2008 .
[10] Peter Deuflhard,et al. Affine conjugate adaptive Newton methods for nonlinear elastomechanics , 2007, Optim. Methods Softw..
[11] Luís Nunes Vicente,et al. Worst case complexity of direct search , 2013, EURO J. Comput. Optim..
[12] Nicholas I. M. Gould,et al. Complexity bounds for second-order optimality in unconstrained optimization , 2012, J. Complex..
[13] Jorge Nocedal,et al. On the geometry phase in model-based algorithms for derivative-free optimization , 2009, Optim. Methods Softw..
[14] Stephen A. Vavasis,et al. Black-Box Complexity of Local Minimization , 1993, SIAM J. Optim..
[15] John Darzentas,et al. Problem Complexity and Method Efficiency in Optimization , 1983 .
[16] S. Vavasis. Nonlinear optimization: complexity issues , 1991 .
[17] Martin J. Wainwright,et al. Information-theoretic lower bounds on the oracle complexity of convex optimization , 2009, NIPS.
[18] P. Toint,et al. Trust-region and other regularisations of linear least-squares problems , 2009 .
[19] Katya Scheinberg,et al. Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization , 2010, SIAM J. Optim..
[20] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization , 2007 .
[21] P. Toint,et al. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity , 2012 .
[22] P. Toint,et al. Optimal estimation of Jacobian and Hessian matrices that arise in finite difference calculations , 1984 .
[23] Arkadi Nemirovski,et al. EFFICIENT METHODS IN CONVEX PROGRAMMING , 2007 .
[24] Nicholas I. M. Gould,et al. Trust Region Methods , 2000, MOS-SIAM Series on Optimization.
[25] Nicholas I. M. Gould,et al. Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2011, Math. Program..
[26] M. Powell,et al. On the Estimation of Sparse Hessian Matrices , 1979 .