Restarting algorithms: sometimes there is free lunch

DOI10.1007/978-3-030-58942-4_2OpenAlexW3089534721MaRDI QIDQ2110384

Sebastian Pokutta

Publication date: 21 December 2022

Full work available at URL: https://arxiv.org/abs/2006.14810

zbMATH Keywords

convex optimizationdiscrete optimizationrestartssubmodular optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Related Items (5)

Transferring information across restarts in MIP ⋮ Robust hybrid zero-order optimization algorithms with acceleration via averaging in time ⋮ Faster first-order primal-dual methods for linear programming using restarts and sharpness ⋮ First-order methods for convex optimization ⋮ Short simplex paths in lattice polytopes

This page was built for publication: Restarting algorithms: sometimes there is free lunch