Worst-case evaluation complexity of a derivative-free quadratic regularization method
From MaRDI portal
Recommendations
- Quadratic regularization methods with finite-difference gradient approximations
- Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound
- Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- Worst case complexity bounds for linesearch-type derivative-free algorithms
Cites work
- A computational framework for derivative-free optimization of cardiovascular geometries
- An unconstrained optimization test functions collection
- Benchmarking Derivative-Free Optimization Algorithms
- Cubic regularization of Newton method and its global performance
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- Gradient-free aerodynamic shape optimization using Large Eddy Simulation
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Lectures on convex optimization
- Quadratic regularization methods with finite-difference gradient approximations
- Random gradient-free minimization of convex functions
- Stochastic three points method for unconstrained smooth minimization
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Worst case complexity of direct search
- Worst case complexity of direct search under convexity
Cited in
(6)- Quadratic regularization methods with finite-difference gradient approximations
- Worst case complexity bounds for linesearch-type derivative-free algorithms
- A partially derivative-free cyclic block coordinate descent method for nonseparable composite optimization
- Fully adaptive zeroth-order method for minimizing functions with compressible gradients
- TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
- First and zeroth-order implementations of the regularized Newton method with lazy approximated Hessians
This page was built for publication: Worst-case evaluation complexity of a derivative-free quadratic regularization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6181370)
