5 citations · 12 across the 19 of their papers we have counts for
8 papers · 1 filter
Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees
Joan Vendrell Gallart, Nhat-Minh Tang-Nguyen, Alan Kuhnle +1
This paper studies joint submodular welfare maximization and routing over graphs, where agents select items under diminishing returns and transport them through a network with cong…
FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
Joan Vendrell Gallart, Russell Bent, Solmaz Kia
This paper considers an optimal radial reconfiguration problem in multi-source distribution networks, where the goal is to find a radial configuration that minimizes quadratic dist…
First-Order Dynamic Optimization for Streaming Convex Costs
M. Rostami, H. Moradian, S. S. Kia
This paper proposes a set of novel optimization algorithms for solving a class of convex optimization problems with time-varying streaming cost function. We develop an approach to…
Fast model averaging via buffered states and first-order accelerated optimization algorithms
Amir-Salar Esteki, Hossein Moradian, Solmaz S. Kia
In this letter, we study the problem of accelerating reaching average consensus over connected graphs in a discrete-time communication setting. Literature has shown that consensus…
Distributed Strategy Selection: A Submodular Set Function Maximization Approach
Navid Rezazadeh, Solmaz S. Kia
Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of m…
A Distributed Continuous-time Modified Newton-Raphson Algorithm
Hossein Moradian, Solmaz S. Kia
We propose a continuous-time second-order optimization algorithm for solving unconstrained convex optimization problems with bounded Hessian. We show that this alternative algorith…