A superlinearly convergent algorithm for minimization without evaluating derivatives
From MaRDI portal
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A comparison of modified Newton methods for unconstrained optimisation
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A Quasi-Newton Method with No Derivatives
- An effective algorithm for minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- An explicit procedure for discretizing continuous, optimal control problems
- Function Minimization by Interpolation in a Data Table
- scientific article; zbMATH DE number 3487225 (Why is no real title available?)
- scientific article; zbMATH DE number 3272538 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Maximization by Quadratic Hill-Climbing
- Methods of conjugate directions versus quasi-Newton methods
- Minimization of functions having Lipschitz continuous first partial derivatives
- Minimizing a function without calculating derivatives
- Newton-type methods for unconstrained and linearly constrained optimization
- On the Relative Efficiencies of Gradient Methods
Cited in
(11)- Global convergence and stabilization of unconstrained minimization methods without derivatives
- A variable metric algorithm for unconstrained minimization without evaluation of derivatives
- On the convergence of a class of derivative-free minimization algorithms
- Optimization of SMES and superconducting magnets with a derivative free deterministic method.
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Linear equalities in blackbox optimization
- A second-order globally convergent direct-search method and its worst-case complexity
- Stopping criteria for linesearch methods without derivatives
- Optimization of functions whose values are subject to small errors
- Derivative-free optimization methods
- A discussion on variational analysis in derivative-free optimization
This page was built for publication: A superlinearly convergent algorithm for minimization without evaluating derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093226)
