Abstract
The goal in sparse approximation is to find a sparse representation of a system. This can be done by minimizing a data-fitting term and a sparsity term at the same time. This sparse term imposes penalty for sparsity. In classical iterative thresholding methods, these two terms are often combined into a single function, where a relaxed parameter is used to balance the error and the sparsity. It is acknowledged that the setting of relaxed parameter is sensitive to the performance of iterative thresholding methods. In this paper, we proposed to address this difficulty by finding a set of nondominated solutions with different sparsity levels via multiobjective evolutionary algorithms (MOEAs). A new MOEA/D is developed specifically for sparse optimization, in which a chain-based random local search (CRLS) is employed for optimizing subproblems with various sparsity levels. The performance of the proposed algorithm, denoted by MOEA/D-CRLS, is tested on a set of sixteen noise-free or noisy test problems. Our experimental results suggest that MOEA/D-CRLS is competitive regarding the solution precision on the noise-free test problems, and clearly superior on the noisy test problems against three existing representative sparse optimization methods.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183–202
Blumensath T, Davies ME (2009) Iterative hard thresholding for compressed sensing. Appl Comput Harmon Anal 27(3):265–274
Cai Z, Wang Y (2006) A multiobjective optimization-based evolutionary algorithm for constrained optimization. IEEE Trans Evol Comput 10(6):658–675
Cai X, Yang Z, Fan Z, Zhang Q (2017) Decomposition-based-sorting and angle-based-selection for evolutionary multiobjective and many-objective optimization. IEEE Trans Cybern 47(9):2824–2837
Carvalho R, Saldanha R, Gomes B, Lisboa A, Martins A (2012) A multi-objective evolutionary algorithm based on decomposition for optimal design of Yagi-Uda antennas. IEEE Trans Magn 48(2):803–806
Coello Coello CA (2000) Constraint handling using an evolutionary multiobjective optimization technique. Civ Eng Environ Syst 17(4):319–346
Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197
Donoho DL (1995) De-noising by soft-thresholding. IEEE Trans Inf Theory 41(3):613–627
Donoho DL (2006) Compressed sensing. IEEE Trans Inf Theory 52(4):1289–1306
Kingsbury N (2001) Complex wavelets for shift invariant analysis and filtering of signals. Appl Comput Harmon Anal 10(3):234–253
Konstantinidis A, Yang K (2011) Multi-objective energy-ecient dense deployment in wireless sensor networks using a hybrid problem-specic MOEA/D. Appl Soft Comput 11(6):4117–4134
Li H, Landa-Silva D (2011) An adaptive evolutionary multi-objective approach based on simulated annealing. Evol Comput 19(4):561–595
Li H, Zhang Q (2009) Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans Evol Comput 13(2):284–302
Li H, Su XL, Xu ZB, Zhang Q (2012) MOEA/D with iterative thresholding algorithm for sparse optimization problems. In: Proceedings of 12th international conference parallel problem solving nature (PPSN), pp 93–101
Li L, Yao X, Stolkin R, Gong MG, He S (2014) An evolutionary multiobjective approach to sparse reconstruction. IEEE Trans Evol Comput 18(6):827–845
Li H, Fan Y, Zhang Q, Xu Z, Deng J (2016) A multi-phase multiobjective approach based on decomposition for sparse reconstruction. In: 2016 IEEE congress on evolutionary computation (CEC), pp 601–608
Li H, Zhang Q, Deng J (2017a) Biased multiobjective optimization and decomposition algorithm. IEEE Trans Cybern 47(1):52–66
Li H, Zhang Q, Deng J, Xu Z (2017b) A preference-based multiobjective evolutionary approach for sparse optimization. IEEE Trans Neural Netw Learn Syst 29:1716–1731
Liu HL, Gu F, Zhang Q (2014) Decomposition of a multiobjective optimization problem into a number of simple multiobjective subproblems. IEEE Trans Evolut Comput 18(3):450–455
Mallat SG, Zhang Z (1993) Matching pursuits with time–frequency dictionaries. IEEE Trans Signal Process 44(12):3397–3415
Medina M, Coello Coello C, Ramirez J (2013) Reactive power handling by a multi-objective teaching learning optimizer based on decomposition. IEEE Trans Power Syst 28(4):3629–3637
Mei Y, Tang K, Yao X (2011) Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem. IEEE Trans Evolut Comput 15(2):151–165
Natraajan BK (1995) Sparse approximation to linear systems. SIAM J Comput 24(2):227–234
Rubio-Largo l, Zhang Q, Vega-Rodrguez MA (2014) A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks. Inf Sci 289:91–116
Tropp J, Gilbert AC (2007) Signal recovery from partial information via orthogonal matching pursuit. IEEE Trans Inf Theory 53(12):4655–4666
Xu Z, Chang X, Xu F, Zhang H (2012) L1/2 regularization: a thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn Syst 23(7):1013–1027
Zeng JS, Xu ZB, Zhang BC, Hong W, Wu YR (2013) Accelerated L1/2 regularization based SAR imaging via BCR and reduced Newton skills. Signal Process 93(7):1831–1844
Zeng J, Lin S, Wang Y, Xu Z (2014) L1/2 regularization: convergence of iterative half thresholding algorithm. IEEE Trans Signal Process 62(9):2317–2329
Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731
Zhang Q, Li H, Maringer D, Tsang EPK (2010) MOEA/D with NBI-style Tchebycheff approach for portfolio management. In: Proceedings of the IEEE congress on evolutionary computation, CEC 2010, Barcelona, Spain, 18–23 July 2010, pp 1–8
Zhou Y, Kwong S, Guo H, Zhang X, Zhang Q (2017) A two-phase evolutionary approach for compressive sensing reconstruction. IEEE Trans Cybern 47(9):2651–2663
Funding
This study was funded by the National Science Foundation of China under Grant 61573279.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
All authors declare that they have no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Informed consent
Informed consent was obtained from all individual participants included in the study.
Additional information
Communicated by F. Chao, Q. Zhang.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Li, H., Sun, J., Wang, M. et al. MOEA/D with chain-based random local search for sparse optimization. Soft Comput 22, 7087–7102 (2018). https://doi.org/10.1007/s00500-018-3460-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3460-y