A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares
The well known Levenberg-Marquardt method is used extensively for solving nonlinear least-squares problems. We describe an extension of the Levenberg- Marquardt method to problems with bound constraints on the variables. Each iteration of our algorithm approximately solves a linear least-squares pro...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
University of British Columbia
2009
|
Online Access: | http://hdl.handle.net/2429/5648 |
id |
ndltd-LACETR-oai-collectionscanada.gc.ca-BVAU.-5648 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-LACETR-oai-collectionscanada.gc.ca-BVAU.-56482013-06-05T04:17:19ZA Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squaresShan, ShidongThe well known Levenberg-Marquardt method is used extensively for solving nonlinear least-squares problems. We describe an extension of the Levenberg- Marquardt method to problems with bound constraints on the variables. Each iteration of our algorithm approximately solves a linear least-squares problem subject to the original bound constraints. Our approach is especially suited to large-scale problems whose functions are expensive to compute; only matrix-vector products with the Jacobian are required. We present the results of numerical experiments that illustrate the effectiveness of the approach. Moreover, we describe its application to a practical curve fitting problem in fluorescence optical imaging.University of British Columbia2009-03-06T19:04:20Z2009-03-06T19:04:20Z20082009-03-06T19:04:20Z2008-11Electronic Thesis or Dissertation7309262 bytesapplication/pdfhttp://hdl.handle.net/2429/5648eng |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
The well known Levenberg-Marquardt method is used extensively for solving
nonlinear least-squares problems. We describe an extension of the Levenberg-
Marquardt method to problems with bound constraints on the variables. Each
iteration of our algorithm approximately solves a linear least-squares problem
subject to the original bound constraints. Our approach is especially suited to
large-scale problems whose functions are expensive to compute; only matrix-vector
products with the Jacobian are required. We present the results of numerical
experiments that illustrate the effectiveness of the approach. Moreover,
we describe its application to a practical curve fitting problem in fluorescence
optical imaging. |
author |
Shan, Shidong |
spellingShingle |
Shan, Shidong A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
author_facet |
Shan, Shidong |
author_sort |
Shan, Shidong |
title |
A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
title_short |
A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
title_full |
A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
title_fullStr |
A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
title_full_unstemmed |
A Levenberg-Marquardt method for large-scale bound-constrained nonlinear least-squares |
title_sort |
levenberg-marquardt method for large-scale bound-constrained nonlinear least-squares |
publisher |
University of British Columbia |
publishDate |
2009 |
url |
http://hdl.handle.net/2429/5648 |
work_keys_str_mv |
AT shanshidong alevenbergmarquardtmethodforlargescaleboundconstrainednonlinearleastsquares AT shanshidong levenbergmarquardtmethodforlargescaleboundconstrainednonlinearleastsquares |
_version_ |
1716586984265220096 |