Restart strategies in a continuous setting

DOI10.1007/S00224-021-10041-0OpenAlexW3158741236MaRDI QIDQ825972FDOQ825972

Authors: Jan-Hendrik Lorenz 

Publication date: 18 December 2021

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

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

Recommendations

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

zbMATH Keywords

randomized algorithmrestartsuniversal strategy

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal speedup of Las Vegas algorithms
• On the complexity of restarting
• Handbook of probability
• Diffusion under time-dependent resetting
• Promise problems on probability distributions
• Runtime distributions and criteria for restarts
• Stochastic models for fault tolerance. Restart, rejuvenation and checkpointing

Cited In (8)

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

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)