activity
20162026
most citedCapacitated Dynamic Programming: Faster Knapsack and Graph Algorithms

10 citations · 20 across the 15 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2022

Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime

Kyriakos Axiotis, Maxim Sviridenko

We propose a simple modification to the iterative hard thresholding (IHT) algorithm, which recovers asymptotically sparser solutions as a function of the condition number. When aim…