activity
20182026
most citedNon-submodular Function Maximization subject to a Matroid Constraint, with Applications

6 citations · 17 across the 24 of their papers we have counts for

collaborators
Showing math.OCShow all

2 papers · 1 filter

math.OC2023

Projection-Free Online Convex Optimization via Efficient Newton Iterations

Khashayar Gatmiry, Zakaria Mhammedi

This paper presents new projection-free algorithms for Online Convex Optimization (OCO) over a convex domain . Classical OCO algorithms (such as O…

math.OC2022

Quasi-Newton Steps for Efficient Online Exp-Concave Optimization

Zakaria Mhammedi, Khashayar Gatmiry

The aim of this paper is to design computationally-efficient and optimal algorithms for the online and stochastic exp-concave optimization settings. Typical algorithms for these se…