scientific article; zbMATH DE number 1746624

MaRDI QIDQ4530783zbMATH OpenFDO

Authors

Publication date 5 June 2002

zbMATH Keywords

parallel computationgeometric convergence ratestochastic algorithmsparallel speedupasymptotically normalityrestarting deterministic algorithms

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Nonlinear programming (90C30)

Recommendations

• Restarting search algorithms with applications to simulated annealing
• scientific article; zbMATH DE number 4080680
• A theoretical approach to restart in global optimization
• Stopping and restarting strategy for stochastic sequential search in global optimization
• Optimization by stochastic methods.

Cited in

(2)

• Geometric convergence of genetic algorithms under tempered random restart
• Restarting search algorithms with applications to simulated annealing

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