Pure Random Search with exponential rate of convergency
From MaRDI portal
Publication:3553768
DOI10.1080/02331930701763447zbMath1184.90068OpenAlexW2144040203MaRDI QIDQ3553768
Publication date: 21 April 2010
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701763447
Related Items (5)
The robust constant and its applications in random global search for unconstrained global optimization ⋮ The Robust Constant and Its Applications in Global Optimization ⋮ On the convergence rate issues of general Markov search for global minimum ⋮ One side cut accelerated random search ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization
Uses Software
Cites Work
- Pure adaptive search in global optimization
- A modified convergence theorem for a random optimization method
- Optimal sequential sampling policy of partitioned random search and its approximation
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- Global optimization by multilevel coordinate search
- Simulated annealing for constrained global optimization
- An electromagnetism-like mechanism for global optimization
- Stochastic minimization with adaptive memory
- Improving hit-and-run for global optimization
- Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Minimization by Random Search Techniques
- On Accelerated Random Search
- Numerical Solution of Systems of Nonlinear Equations
- Randomized Pattern Search
- On uniform covering, adaptive random search and raspberries
This page was built for publication: Pure Random Search with exponential rate of convergency
