Worst case complexity of direct search under convexity
From MaRDI portal
(Redirected from Publication:5962720)
Recommendations
- On the optimal order of worst case complexity of direct search
- Worst case complexity of direct search
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- STACS 2005
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Complexity of multilinear problems in the worst case setting
- scientific article; zbMATH DE number 509206
- scientific article; zbMATH DE number 1512702
Cites work
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Convex Analysis
- Cubic regularization of Newton method and its global performance
- CUTEr and SifDec
- Efficiency of coordinate descent methods on huge-scale optimization problems
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Introductory lectures on convex optimization. A basic course.
- On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
- On the Local Convergence of Pattern Search
- On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Random gradient-free minimization of convex functions
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Worst case complexity of direct search
Cited in
(21)- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- On the worst-case evaluation complexity of non-monotone line search algorithms
- An indicator for the switch from derivative-free to derivative-based optimization
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- Efficient unconstrained black box optimization
- On the optimal order of worst case complexity of direct search
- A second-order globally convergent direct-search method and its worst-case complexity
- On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- scientific article; zbMATH DE number 1512702 (Why is no real title available?)
- Stochastic three points method for unconstrained smooth minimization
- A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization
- Derivative-free optimization methods
- Direct search based on probabilistic descent
- On the worst-case inefficiency of CGKA
- Worst-case evaluation complexity of a derivative-free quadratic regularization method
- Worst case complexity bounds for linesearch-type derivative-free algorithms
- Stochastic zeroth order descent with structured directions
- Direct-search methods in the year 2025: theoretical guarantees and algorithmic paradigms
- A subspace inertial method for derivative-free nonlinear monotone equations
- Worst case complexity of direct search
This page was built for publication: Worst case complexity of direct search under convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962720)
