scientific article; zbMATH DE number 3905759
From MaRDI portal
Publication:3683446
[For the entire collection see Zbl 0555.00008.] A random search algorithm is suggested that adapts to situations arising in the search process. Experimentally convergence speed and convergence are investigated and compared as for convergence speed to algorithms of recalculation and of statistical gradient.
Recommendations
Cited in
(12)- A random search strategy for function optimization
- Random orthocenter strategy in interior search algorithm and its engineering application
- scientific article; zbMATH DE number 3902419 (Why is no real title available?)
- scientific article; zbMATH DE number 3905817 (Why is no real title available?)
- scientific article; zbMATH DE number 3905818 (Why is no real title available?)
- scientific article; zbMATH DE number 3967653 (Why is no real title available?)
- scientific article; zbMATH DE number 3974710 (Why is no real title available?)
- scientific article; zbMATH DE number 4029304 (Why is no real title available?)
- scientific article; zbMATH DE number 4102493 (Why is no real title available?)
- scientific article; zbMATH DE number 4104377 (Why is no real title available?)
- scientific article; zbMATH DE number 2099379 (Why is no real title available?)
- Alternative adaptation of the structure of search optimization algorithms using specimen recognition methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683446)