Algorithms for convex optimization

Lieven Vandenberghe
UCLA
EE

The talk will be an overview of some recent developments in
algorithms for convex optimization. In particular I will focus
on interior-point methods for nonlinear convex optimization,
techniques for exploiting problem structure in large-scale
applications, and cutting-plane methods suited for distributed
implementation.


Back to Large-Scale Engineering Networks: Robustness, Verifiability, and Convergence