.png){kind=icon}
.png){kind=icon}
Return
Blind source separation using block-coordinate relative Newton method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2004.05.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Presented here is a block-coordinate version of the relative Newton method, recently proposed for quasi-maximum likelihood blind source separation. Special structure of the Hessian matrix allows performing block-coordinate Newton descent efficiently. Simulations show that typically our method converges in near constant number of iterations (order of 10) independently of the problem size. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
blind source separation
block-coordinate optimization
quasi-maximum likelihood
Newton algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
Organization
No organization information available