Login / Signup
An Efficient Interior-Point Method for Online Convex Optimization.
Elad Hazan
Nimrod Megiddo
Published in:
CoRR (2023)
Keyphrases
</>
interior point methods
convex optimization
online convex optimization
linear programming
semidefinite programming
quadratic programming
linear program
primal dual
cost function
solving problems
lower bound
active learning
np hard
online learning
low rank