Abstract
A block-iterative parallel decomposition method is proposed to solve general quadratic signal recovery problems under convex constraints. Unlike existing schemes, the proposed method proceeds by local linearizations of blocks of constraints and it is therefore not sensitive to their analytical complexity. Implementation-related issues are discussed and an application to signal deconvolution is demonstrated.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
