6 citations · 10 across the 3 of their papers we have counts for
3 papers
math.OC2019
Competitive Algorithms for Online Budget-Constrained Continuous DR-Submodular Problems
Omid Sadeghi, Reza Eghbali, Maryam Fazel
In this paper, we study a certain class of online optimization problems, where the goal is to maximize a function that is not necessarily concave and satisfies the Diminishing Retu…
cs.DS2016★ 4 cited
Worst Case Competitive Analysis of Online Algorithms for Conic Optimization
Reza Eghbali, Maryam Fazel
Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separ…
math.OC2014★ 6 cited
Exponentiated Subgradient Algorithm for Online Optimization under the Random Permutation Model
Reza Eghbali, Jon Swenson, Maryam Fazel
Online optimization problems arise in many resource allocation tasks, where the future demands for each resource and the associated utility functions change over time and are not k…