In this work we consider a block coordinate descent method that uses an "inexact" update. We present iteration complexity results for the new method, and study how the update step can be sped up through the use of preconditioning.
Current 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
