摘要

Sparse reconstruction (SR) algorithms are widely used in acquiring high-quality recovery results in compressed sensing. Existing algorithms solve SR problem by combining two contradictory objectives (measurement error and sparsity) using a regularizing coefficient. However, this coefficient is hard to determine and has a large impact on recovery quality. To address this concern, this paper converts the traditional SR problem to a multiobjective SR problem which tackles the two objectives simultaneously. A hybrid evolutionary paradigm is proposed, in which differential evolution is employed and adaptively configured for exploration and a local search operator is designed for exploitation. Another contribution is that the traditional linearized Bregman method is improved and used as the local search operator to increase the exploitation capability. Numerical simulations validate the effectiveness and competitiveness of the proposed hybrid evolutionary algorithm with LB-based local search in comparison with other algorithms.