期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 51, 期 7, 页码 1771-1782出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2003.812846
关键词
block-iterative optimization; convex analysis; deconvolution; quadratic programming; signal recovery; subgradient projection
A block-iterative parallel decomposition method is proposed to solve general quadratic signal recovery problems under convex constraints. The proposed method proceeds by local linearizations of blocks of constraints, and it is therefore not sensitive to their analytical complexity. In addition, it naturally lends itself to implementation on parallel computing architectures due to its flexible block-iterative structure. Comparisons with existing methods are carried out, and the case of inconsistent constraints is also discussed. Numerical results are presented.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据