Global complexity bound of the Levenberg–Marquardt method. (3rd July 2016)
- Record Type:
- Journal Article
- Title:
- Global complexity bound of the Levenberg–Marquardt method. (3rd July 2016)
- Main Title:
- Global complexity bound of the Levenberg–Marquardt method
- Authors:
- Zhao, Ruixue
Fan, Jinyan - Abstract:
- Abstract : In this paper, we propose a new updating rule of the Levenberg–Marquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is, that is, it requires at most iterations to derive the norm of the gradient of the merit function below the desired accuracy .
- Is Part Of:
- Optimization methods and software. Volume 31:Number 4(2016)
- Journal:
- Optimization methods and software
- Issue:
- Volume 31:Number 4(2016)
- Issue Display:
- Volume 31, Issue 4 (2016)
- Year:
- 2016
- Volume:
- 31
- Issue:
- 4
- Issue Sort Value:
- 2016-0031-0004-0000
- Page Start:
- 805
- Page End:
- 814
- Publication Date:
- 2016-07-03
- Subjects:
- nonlinear equations -- Levenberg–Marquardt method -- global complexity bound
65K05 -- 65K10 -- 90C30
Mathematical optimization -- Periodicals
Algorithms -- Periodicals
519.7 - Journal URLs:
- http://www.tandfonline.com/toc/goms20/current ↗
http://www.tandfonline.com/ ↗ - DOI:
- 10.1080/10556788.2016.1179737 ↗
- Languages:
- English
- ISSNs:
- 1055-6788
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 6275.120000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 1421.xml