Restart strategies in a continuous setting

DOI10.1007/S00224-021-10041-0MaRDI QIDQ825972zbMATH OpenOpenAlexFDO

Authors Jan-Hendrik Lorenz

Publication date 18 December 2021

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00224-021-10041-0

zbMATH Keywords

randomized algorithmrestartsuniversal strategy

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Recommendations

• Restart strategies in optimization: parallel and serial cases
• On the complexity of restarting
• A theoretical approach to restart in global optimization

Cites work

• scientific article; zbMATH DE number 699423 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Diffusion under time-dependent resetting
• Handbook of probability
• On the complexity of restarting
• Optimal speedup of Las Vegas algorithms
• Promise problems on probability distributions
• Runtime distributions and criteria for restarts
• Stochastic models for fault tolerance. Restart, rejuvenation and checkpointing

Cited in

(8)

• Comparing the roles of time overhead and spatial dimensions on optimal resetting rate vanishing transitions, in Brownian processes with potential bias and stochastic resetting
• scientific article; zbMATH DE number 679855 (Why is no real title available?)
• Runtime distributions and criteria for restarts
• Mean-performance of sharp restart I: statistical roadmap
• The inspection paradox in stochastic resetting
• Restart strategies and Internet congestion
• Restart strategies in optimization: parallel and serial cases
• Combinatorial algorithms of solutions of the problems of discrete optimization and RESTART distributions

This page was built for publication: Restart strategies in a continuous setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825972)