scientific article; zbMATH DE number 4039157

From MaRDI portal
Publication:3777346





[For the entire collection see Zbl 0619.00026.] The paper deals with the convergence, speed of convergence and the computational complexity of two global optimization algorithms: the annealing algorithm (for the discrete case) and the Langevin algorithm (for the manifold case).











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 Q3777346)