Optimization Online


An Iterative algorithm for large size Least-Squares constrained regularization problems.

Elena Loli Piccolomini(piccolom***at***dm.unibo.it)
Zama Fabiana(zama***at***dm.unibo.it)

Abstract: 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.

Keywords: nverse ill-posed problems, Constrained optimization, Iterative methods

Category 1: Nonlinear Optimization (Bound-constrained Optimization )

Category 2: Applications -- Science and Engineering


Download: [PDF]

Entry Submitted: 01/14/2011
Entry Accepted: 01/14/2011
Entry Last Modified: 01/14/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society