activity
20122023
most citedOptimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems

438 citations · 582 across the 10 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2017

Sparsity-Promoting Iterative Learning Control for Resource-Constrained Control Systems

Burak Demirel, Euhanna Ghadimi, Daniel E. Quevedo

We propose novel iterative learning control algorithms to track a reference trajectory in resource-constrained control systems. In many applications, there are constraints on the n…

math.OC2016

A Reinforcement Learning Approach to Power Control and Rate Adaptation in Cellular Networks

Euhanna Ghadimi, Francesco Davide Calabrese, Gunnar Peters +1

Optimizing radio transmission power and user data rates in wireless systems via power control requires an accurate and instantaneous knowledge of the system model. While this probl…

math.OC2014★ 8 cited

Global convergence of the Heavy-ball method for convex optimization

Euhanna Ghadimi, Hamid Reza Feyzmahdavian, Mikael Johansson

This paper establishes global convergence and provides global bounds of the convergence rate of the Heavy-ball method for convex optimization problems. When the objective function…

math.OC2013★ 438 cited

Optimal parameter selection for the alternating direction method of multipliers (ADMM): quadratic problems

Euhanna Ghadimi, André Teixeira, Iman Shames +1

The alternating direction method of multipliers (ADMM) has emerged as a powerful technique for large-scale structured optimization. Despite many recent results on the convergence p…

math.OC2013★ 17 cited

Optimal scaling of the ADMM algorithm for distributed quadratic programming

André Teixeira, Euhanna Ghadimi, Iman Shames +2

This paper presents optimal scaling of the alternating directions method of multipliers (ADMM) algorithm for a class of distributed quadratic programming problems. The scaling corr…

math.OC2012★ 94 cited

Accelerated Gradient Methods for Networked Optimization

Euhanna Ghadimi, Iman Shames, Mikael Johansson

We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients. Given the topology of the underlying n…