Recurrent search optimization algorithms in the presence of relative noise. II: Optimal search procedures
From MaRDI portal
zbMATH Open0652.90079MaRDI QIDQ1107447FDOQ1107447
Authors: D. A. Murtazin, Alexander S. Poznyak 
Publication date: 1987
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- Recursion algorithms for search optimization in relative noise. I: Maximal possibilities
- scientific article; zbMATH DE number 3926670
- scientific article; zbMATH DE number 3856971
- Approximate implementations of pure random search in the presence of noise
- Optimal order of accuracy of search algorithms in stochastic optimization
Numerical mathematical programming methods (65K05) Search theory (90B40) Stochastic programming (90C15)
Cited In (7)
- Recursion algorithms for search optimization in relative noise. I: Maximal possibilities
- Novel supervisor-searcher cooperation algorithms for minimization problems with strong noise*
- Title not available (Why is that?)
- Tabu search when noise is present: An illustration in the context of cause and effect analysis
- Random Search in the Presence of Noise, with Application to Machine Learning
- Title not available (Why is that?)
- Approximate implementations of pure random search in the presence of noise
This page was built for publication: Recurrent search optimization algorithms in the presence of relative noise. II: Optimal search procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107447)
