Restarting algorithms: sometimes there is free lunch

DOI10.1007/978-3-030-58942-4_2MaRDI QIDQ2110384zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(8)

• Short simplex paths in lattice polytopes
• 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
• Restarting Algorithms: Sometimes there is Free Lunch
• The complexity of geometric scaling
• A practical and optimal first-order method for large-scale convex quadratic programming

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

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