Random Search Algorithms with Sufficient Descent for Minimization of Functions
From MaRDI portal
Recommendations
Cited in
(21)- Spline and weighted random directions method for nonlinear optimization
- Lognormal law for a renormalization chain arising in search theory and the modelling of descent algorithms
- A random search strategy for function optimization
- Stochastic minimization with adaptive memory
- Steepest descent method with random step lengths
- Continuous functions minimization by dynamic random search technique
- A heuristic approach for finding the global minimum: Adaptive random search technique
- Effort associated with a class of random optimization methods
- Optimization by random search with jumps
- Minimization Algorithms for Functions with Random Noise
- scientific article; zbMATH DE number 3901926 (Why is no real title available?)
- scientific article; zbMATH DE number 3902411 (Why is no real title available?)
- scientific article; zbMATH DE number 3905762 (Why is no real title available?)
- scientific article; zbMATH DE number 3906250 (Why is no real title available?)
- A statistic method for the computation of the conjugate directions
- scientific article; zbMATH DE number 3987063 (Why is no real title available?)
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
- scientific article; zbMATH DE number 1335838 (Why is no real title available?)
- On Accelerated Random Search
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- An \(\mathcal{O} (n)\) algorithm for generating uniform random vectors in \(n\)-dimensional cones
This page was built for publication: Random Search Algorithms with Sufficient Descent for Minimization of Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4206579)
