Restarting algorithms: sometimes there is free lunch
From MaRDI portal
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)