In recent years, there has been a growing interest in problems in graph estimation and model selection, which all share very similar matrix variational formulations, the most popular one being probably GLASSO. Unfortunately, the standard GLASSO formulation does not take into account noise corrupting the data: this shortcoming leads us to propose a novel cost function, where the regularization function is decoupled in two terms, one acting only on the eigenvalues of the matrix and the other on the matrix elements. Incorporating noise information into the model has the side–effect to make the cost function non–convex. To overcome this difficulty, we adopt a majorization–minimization approach, where at each iteration a convex approximation of the original cost function is minimized via the Douglas–Rachford procedure. The achieved results are very promising w.r.t. classical approaches.
Joint work with Alessandro Benfenati and Jean-Christophe Pesquet)
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
