Nearly-Linear Time Packing and Covering LP Solver with Faster Convergence Rate Than $O(1/\varepsilon^2)$.

Zeyuan Allen Zhu Lorenzo Orecchia

Published in: CoRR (2014)

Keyphrases

faster convergence rate
convergence rate
linear programming
k means
genetic algorithm
particle swarm optimisation
linear program
packing problem
sample size
worst case
optimal solution
vc dimension
information retrieval
metadata
objective function
convergence speed