## Relative Newton and Smoothing Multiplier Optimization Methods for Blind Source Separation (2007)

### Cached

### Download Links

Citations: | 1 - 0 self |

### BibTeX

@MISC{Zibulevsky07relativenewton,

author = {Michael Zibulevsky},

title = { Relative Newton and Smoothing Multiplier Optimization Methods for Blind Source Separation },

year = {2007}

}

### OpenURL

### Abstract

We study a relative optimization framework for quasi-maximum likelihood blind source separation and relative Newton method as its particular instance. The structure of the Hessian allows its fast approximate inversion. In the second part we present Smoothing Method of Multipliers (SMOM) for minimization of sum of pairwise maxima of smooth functions, in particular sum of absolute value terms. Incorporating Lagrange multiplier into a smooth approximation of max-type function, we obtain an extended notion of non-quadratic augmented Lagrangian. Our approach does not require artificial variables, and preserves the sparse structure of Hessian. Convergence of the method is further accelerated by the Frozen Hessian strategy. We demonstrate efficiency of this approach on an example of blind separation of sparse sources. The non-linearity in this case is based on the absolute value function, which provides super-efficient source separation.