journal article Jan 01, 2021

A variant of the Levenberg-Marquardt method with adaptive parameters for systems of nonlinear equations

View at Publisher Save 10.3934/math.2022073
Abstract
<abstract><p>The Levenberg-Marquardt method is one of the most important methods for solving systems of nonlinear equations and nonlinear least-squares problems. It enjoys a quadratic convergence rate under the local error bound condition. Recently, to solve nonzero-residue nonlinear least-squares problem, Behling et al. propose a modified Levenberg-Marquardt method with at least superlinearly convergence under a new error bound condtion <sup>[<xref ref-type="bibr" rid="b3">3</xref>]</sup>. To extend their results for systems of nonlinear equations, by choosing the LM parameters adaptively, we propose an efficient variant of the Levenberg-Marquardt method and prove its quadratic convergence under the new error bound condition. We also investigate its global convergence by using the Wolfe line search. The effectiveness of the new method is validated by some numerical experiments.</p></abstract>
Topics

No keywords indexed for this article. Browse by subject →

References
21
[1]
Local convergence of the Levenberg–Marquardt method under Hölder metric subregularity

Masoud Ahookhosh, Francisco J. Aragón Artacho, Ronan M. T. Fleming et al.

Advances in Computational Mathematics 10.1007/s10444-019-09708-7
[2]
K. Amini, F. Rostami, G. Caristi, An efficient Levenberg-Marquardt method with a new LM parameter for systems of nonlinear equations, <i>Optimization</i>, <b>67</b> (2018), 637–650. doi: 10.1080/02331934.2018.1435655. 10.1080/02331934.2018.1435655
[3]
Local Convergence Analysis of the Levenberg–Marquardt Framework for Nonzero-Residue Nonlinear Least-Squares Problems Under an Error Bound Condition

Roger Behling, Douglas S. Gonçalves, Sandra A. Santos

Journal of Optimization Theory and Applications 10.1007/s10957-019-01586-9
[4]
J. E. Dennis, R. B. Schnable, <i>Numerical methods for unconstrained optimization and nonlinear equations</i>, 1983. doi: <a href="http://dx.doi.org/10.1137/1.9781611971200" target="_blank">10.1137/1.9781611971200</a>. 10.1137/1.9781611971200
[5]
J. Y. Fan, J. Y. Pan, A note on the Levenberg-Marquardt parameter, <i>Appl. Math. Comput.</i>, <b>207</b> (2009), 351–359. doi: 10.1016/j.amc.2008.10.056. 10.1016/j.amc.2008.10.056
[6]
J. Y. Fan, Y. X. Yuan, On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption, <i>Computing</i>, <b>74</b> (2005), 23–39. doi: 10.1007/s00607-004-0083-1. 10.1007/s00607-004-0083-1
[7]
F. Andreas, Local behavior of an iterative framework for generalized equations with nonisolated solutions, <i>Math. Program.</i>, <b>94</b> (2002), 91–124. doi: 10.1007/s10107-002-0364-4. 10.1007/s10107-002-0364-4
[8]
L. Guo, G. H. Lin, J. J. Ye, Solving mathematical programs with equilibrium constraints, <i>J. Optim. Theory Appl.</i>, <b>166</b> (2015), 234–256. doi: 10.1007/s10957-014-0699-z. 10.1007/s10957-014-0699-z
[9]
M. Heydari, T. D. Niri, M. M. Hosseini, A new modified trust region algorithm for solving unconstrained optimization problems, <i>J. Math. Ext.</i>, <b>12</b> (2018), 115–135.
[10]
E. W. Karas, S. A. Santos, B. F. Svaiter, Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method, <i>Comput. Optim. Appl.</i>, <b>65</b> (2016), 723–751. doi: 10.1007/s10589-016-9845-x. 10.1007/s10589-016-9845-x
[11]
C. F. Ma, L. H. Jiang, Some research on Levenberg-Marquardt method for the nonlinear equations, <i>Appl. Math. Comput.</i>, <b>184</b> (2007), 1032–1040. doi: 10.1016/j.amc.2006.07.004. 10.1016/j.amc.2006.07.004
[12]
Testing Unconstrained Optimization Software

Jorge J. Moré, Burton S. Garbow, Kenneth E. Hillstrom

ACM Transactions on Mathematical Software 10.1145/355934.355936
[13]
T. D. Niri, M. Heydari, M. M. Hosseini, Correction of trust region method with a new modified Newton method, <i>Int. J. Comput. Math.</i>, <b>97</b> (2020), 1118–1132. doi: 10.1080/00207160.2019.1607844. 10.1080/00207160.2019.1607844
[14]
H. V. Ngai, Global error bounds for systems of convex polynomials over polyhedral constraints, <i>SIAM J. Optim.</i>, <b>25</b> (2015), 521–539. doi: 10.1137/13090599X. 10.1137/13090599x
[15]
J. Nocedal, S. J. Wright, <i>Numerical optimization</i>, New York: Springer, 1999. doi: <a href="http://dx.doi.org/10.1007/978-3-540-35447-5" target="_blank">10.1007/978-3-540-35447-5</a>. 10.1007/978-3-540-35447-5
[16]
Tensor Methods for Nonlinear Equations

Robert B. Schnabel, Paul D. Frank

SIAM Journal on Numerical Analysis 10.1137/0721054
[17]
H. H. Vui, Global Hölderian error bound for nondegenerate polynomials, <i>SIAM J. Optim.</i>, <b>23</b> (2013), 917–933. doi: 10.1137/110859889. 10.1137/110859889
[18]
H. Y. Wang, J. Y. Fan, Convergence rate of the Levenberg-Marquardt method under Hölderian local error bound, <i>Optim. Method. Softw</i>, <b>35</b> (2020), 767–786. doi: 10.1080/10556788.2019.1694927. 10.1080/10556788.2019.1694927
[19]
N. Yamashita, M. Fukushima, On the rate of convergence of the Levenberg-Marquardt method, In: <i>Topics in numerical analysis</i>, Vienna: Springer, <b>15</b> (2001), 239–249. doi: <a href="http://dx.doi.org/10.1007/978-3-7091-6217-0_18" target="_blank">10.1007/978-3-7091-6217-0_18</a>. 10.1007/978-3-7091-6217-0_18
[20]
Y. X. Yuan, Problems on convergence of unconstrained optimization algorithms, In: <i>Numerical linear algebra and optimization</i>, Beijing: Science Press, 1999, 95–107.
[21]
X. D. Zhu, G. H. Lin, Improved convergence results for a modified Levenberg-Marquardt method for nonlinear equations and applications in MPCC, <i>Optim. Method. Software</i>, <b>31</b> (2016), 791–804. doi: 10.1080/10556788.2016.1171863. 10.1080/10556788.2016.1171863
Cited By
12
Journal of Applied Mathematics and...
Metrics
12
Citations
21
References
Details
Published
Jan 01, 2021
Vol/Issue
7(1)
Pages
1241-1256
Cite This Article
Lin Zheng, Liang Chen, Yanfang Ma (2021). A variant of the Levenberg-Marquardt method with adaptive parameters for systems of nonlinear equations. AIMS Mathematics, 7(1), 1241-1256. https://doi.org/10.3934/math.2022073