Cited in
(39)- A global optimization algorithm using adaptive random search
- Systematic choice of initial points in local search: Extensions and application to neural networks
- A decision model and methodology for the AIDS epidemic
- Machine learning for optimal blackjack counting strategies
- A modified convergence theorem for a random optimization method
- Fuzzy control of unknown multiple-input-multiple-output plants
- An evolutionary programming approach to mixed-variable optimization problems
- A survey of model reference adaptive techniques - theory and applications
- Continuous action set learning automata for stochastic optimization
- Determining functional relationships from trained neural networks
- An improved clustering method based on biological visual models
- Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations
- A subsampling approach for Bayesian model selection
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- Gradient-free distributed optimization with exact convergence
- Comparing gradient descent with automatic differentiation and particle swarm optimization techniques for estimating tumor blood flow parameters in contrast-enhanced imaging
- State transition algorithm
- Random gradient-free minimization of convex functions
- Memetic particle swarm optimization
- Parameter selection and adaptation in Unified Particle Swarm Optimization
- Continuous functions minimization by dynamic random search technique
- A heuristic approach for finding the global minimum: Adaptive random search technique
- Response identification of distributed systems with noisy measurements at finite points
- Progressive global random search of continuous functions
- Hybridizing local search algorithms for global optimization
- Stochastic three points method for unconstrained smooth minimization
- Derivative-free optimization methods
- Parameter choice strategies for least-squares approximation of noisy smooth functions on the sphere
- A homotopy approach to improving PEM identification of ARMAX models
- Stochastic approximation algorithms: overview and recent trends.
- Zeroth-order optimization with orthogonal random directions
- A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
- Leveraging randomized smoothing for optimal control of nonsmooth dynamical systems
- Self-learning general purpose PID controller
- NPROS: a not so pure random orthogonal search algorithm -- a suite of random optimization algorithms driven by reinforcement learning
- Recurrent neuro-fuzzy hybrid-learning approach to accurate system modeling
- A new heuristic approach for non-convex optimization problems
This page was built for publication: Random optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525478)
