AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (374.2 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

An accelerated adaptive two-step Levenberg–Marquardt method with the modified Metropolis criterion

Dingyu ZhuYueting Yang( )Mingyuan Cao( )
School of Mathematics and Statistics, Beihua University, Jilin 132013, China
Show Author Information

Abstract

In this paper, aiming at the nonlinear equations, a new two-step Levenberg–Marquardt method was proposed. We presented a new Levenberg–Marquardt parameter to obtain the trial step. A new modified Metropolis criterion was used to adjust the upper bound of the approximate step. The convergence of the method was analyzed under the H o¨lderian local error bound condition and the H ¨olderian continuity of the Jacobian. Numerical experiments showed that the new algorithm is effective and competitive in the numbers of functions, Jacobian evaluations and iterations.

CLC number: 65K05, 90C30

References

【1】
【1】
 
 
AIMS Mathematics
Pages 24610-24635

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Zhu D, Yang Y, Cao M. An accelerated adaptive two-step Levenberg–Marquardt method with the modified Metropolis criterion. AIMS Mathematics, 2024, 9(9): 24610-24635. https://doi.org/10.3934/math.20241199

91

Views

2

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 11 June 2024
Revised: 11 August 2024
Accepted: 15 August 2024
Published: 15 September 2024
©2024 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)