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.











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)