Yuri Nesterov (Center for Operations Research and Econometrics, Catholic University of Louvain, Belgium)

Dual methods for minimizing functions with bounded variation
Joint work with A. Gasnikov (IITP, Moscow).
Wednesday 15 May 2013 at 15.30, JCMB 6206

Abstract

We propose a new approach for justifying complexity bounds for dual optimization methods. Dual problems often have very big or unbounded size of the optimal solutions. This makes impossible to apply to the complexity analysis of corresponding schemes the standard framework. In this talk we propose new methods, which can work with unbounded feasible sets. All these methods are primal-dual: they generate both primal and dual solutions with required accuracy/feasibility guarantees.

Seminars by year

Current 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996