← Home

Historical Information-based Optimization

This topic studies how historical iterates, gradients, and other algorithm information can be reused to improve convergence of optimization algorithms.

Asynchronous Optimization

We develop delay-robust methods for optimization and learning under heterogeneous computation and communication.

Stochastic Optimization

This direction concerns optimization methods for learning and large-scale problems involving stochastic updates.

Decentralized Optimization

We develop communication-efficient algorithms to solve optimization problems over networks.

Safety-critical Optimization

We propose algorithms that produce all-feasible iterates to solve optimization problems in safety-critical scenarios.

Optimization over Time-varying Networks

We solve optimization problems over networks that change with iterations.