First- and second-order high probability complexity bounds for trust-region methods with noisy oracles

This publication has 17 references indexed in Scilit:

• Random Gradient-Free Minimization of Convex Functions
  Foundations of Computational Mathematics, 2015
• Recent advances in trust region algorithms
  Mathematical Programming, 2015
• Convergence of Trust-Region Methods Based on Probabilistic Models
  SIAM Journal on Optimization, 2014
• Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
  Mathematical Programming, 2012
• Sample size selection in optimization methods for machine learning
  Mathematical Programming, 2012
• Benchmarking Derivative-Free Optimization Algorithms
  SIAM Journal on Optimization, 2009
• Cubic regularization of Newton method and its global performance
  Mathematical Programming, 2006
• UOBYQA: unconstrained optimization by quadratic approximation
  Mathematical Programming, 2002
• On the Lagrange functions of quadratic models that are defined by interpolation^*
  Optimization Methods and Software, 2001
• On the Global Convergence of Trust Region Algorithms Using Inexact Gradient Information
  SIAM Journal on Numerical Analysis, 1991