3 papers across 2 sessions
A novel projection-free framework for solving (non-)convex optimization over general compact convex set without expensive per-iteration optimization oracles.
A new projection-free algorithm for online convex optimization that relies on a separation oracle and does not require preconditioning of the feasible set.