arrow
Return

Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework

delete2017-06-21
delete22
PRE
AI
M
Maoguo Gong *
X
Xiangming Jiang
李浩 cover
李浩 (Hao Li)
DOI:10.1007/s11704-016-5552-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Ill-posed problems are widely existed in signal processing. In this paper, we review popular regularization models such as truncated singular value decomposition regularization, iterative regularization, variational regularization. Meanwhile, we also retrospect popular optimization approaches and regularization parameter choice methods. In fact, the regularization problem is inherently a multi-objective problem. The traditional methods usually combine the fidelity term and the regularization term into a single-objective with regularization parameters, which are difficult to tune. Therefore, we propose a multi-objective framework for ill-posed problems, which can handle complex features of problem such as non-convexity, discontinuity. In this framework, the fidelity term and regularization term are optimized simultaneously to gain more insights into the ill-posed problems. A case study on signal recovery shows the effectiveness of the multi-objective framework for ill-posed problems.
Keywords:
ill-posed problem
regularization
multi-objective optimization
evolutionary algorithm
signal processing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Frontiers of Computer Science cover
Frontiers of Computer Science
IF:
4.6
Papers:
1.6K
Citations:
2.8K

Organization

X
Xidian University
Scholars:
2.4W
Papers: 1.9W
Citations: 9.7K