By Topic

A block-iterative surrogate constraint splitting method for quadratic signal recovery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
P. L. Combettes ; Lab. Jacques-Louis Lions, Univ. Pierre et Marie Curie, Paris, France

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.

Published in:

IEEE Transactions on Signal Processing  (Volume:51 ,  Issue: 7 )