Pages that link to "Item:Q2110384"
From MaRDI portal
The following pages link to Restarting algorithms: sometimes there is free lunch (Q2110384):
Displaying 7 items.
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- Robust hybrid zero-order optimization algorithms with acceleration via averaging in time (Q2662325) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Restarting Algorithms: Sometimes there is Free Lunch (Q6343792) (← links)
- The complexity of geometric scaling (Q6556153) (← links)
