.png){kind=icon}
.png){kind=icon}
Return
An iterative algorithm for large size least-squares constrained regularization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2011.04.086.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we propose an iterative algorithm to solve large size linear inverse ill posed problems. The regularization problem is formulated as a constrained optimization problem. The dual Lagrangian problem is iteratively solved to compute an approximate solution. Before starting the iterations, the algorithm computes the necessary smoothing parameters and the error tolerances from the data. The numerical experiments performed on test problems show that the algorithm gives good results both in terms of precision and computational efficiency. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
Inverse ill-posed problems
Constrained optimization
Iterative methods
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W