Multistart algorithm for identifying all optima of nonconvex stochastic functions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 1301595 (Why is no real title available?)
- A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
- A multistart gradient-based algorithm with surrogate model for global optimization
- A quasi-multistart framework for global optimization of expensive functions using response surface models
- ASTRO-DF: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Asynchronously parallel optimization solver for finding multiple minima
- Benchmarking Derivative-Free Optimization Algorithms
- Hyperband: a novel bandit-based approach to hyperparameter optimization
- Improving the flexibility and robustness of model-based derivative-free optimization solvers
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Multistart global optimization with tunnelling and an evolutionary strategy supervised by a martingale
- Multistart with early termination of descents
- On the diffusion approximation of nonconvex stochastic gradient descent
- Probability. Theory and examples.
- Relaxing the assumptions of the multilevel single linkage algorithm
- SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Stochastic optimization with adaptive restart: a framework for integrated local and global learning
This page was built for publication: Multistart algorithm for identifying all optima of nonconvex stochastic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968939)
