1 citations · 1 across the 7 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2026
The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
Greedy algorithms efficiently approximate combinatorial optimization problems, but their guarantees weaken when feasibility couples combinatorial structure with global physical con…
math.OC2024
Time-Varying Convex Optimization with Computational Complexity
M. Rostami, S. S. Kia
In this article, we consider the problem of unconstrained time-varying convex optimization, where the cost function changes with time. We provide an in-depth technical analysis of…