Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지
DOI QR코드

DOI QR Code

SOME GLOBAL CONVERGENCE PROPERTIES OF THE LEVENBERG-MARQUARDT METHODS WITH LINE SEARCH

  • 투고 : 2012.04.12
  • 심사 : 2012.10.25
  • 발행 : 2013.05.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we consider two kinds of the Levenberg-Marquardt method for solve a system of nonlinear equations. We use line search on every iteration to guarantee that the Levenberg-Marquardt methods are globally convergent. Under mild conditions, we prove that while the de- scent condition can be satisfied at the iteration of the Levenberg-Marquardt method, the global convergence of the method can be established.

키워드

참고문헌

  1. A.N.Iusem and M.V. Solodov, Newton-type methods with generalized distances for constrained optimization, Optimization 41 (1997), 257-278. https://doi.org/10.1080/02331939708844339
  2. Y.B.Zhao and D. Li, Monotonicity of fixed point and normal mappings associated with variational inequality and its application, SIAM Journal on Optimization 11 (2001), 962-973. https://doi.org/10.1137/S1052623499357957
  3. C. Wang and Y. Wang and C. Xu, A projection method for a system of nonlinear monotone equations with convex constraints, Mathematical Methods of Operations Research 66 (2007), 36-46.
  4. W.J.Zhou and D.Li, Limited memory BFGS method for nonlinear monotone equations, Journal of Computational Mathematics 25 (2007), 89-96.
  5. K. Levenberg, A method for the solution of certain nonlinear problems in least squares, Quart. Appl. Math. 2 (1944), 164-166. https://doi.org/10.1090/qam/10666
  6. D.W. Marquardt, An algorithm for least-squares estimation of nonlinear inequalities, SIAM J. Appl. Math. 11 (1963), 431-441. https://doi.org/10.1137/0111030
  7. J.Y.Fan and Y.X.Yuan, On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption, Computing 74 (2005), 23-39. https://doi.org/10.1007/s00607-004-0083-1
  8. N.Yamashita and M. Fukushima, On the rate of convergence of the Levenberg-Marquardt method, Computing 15 (2001), 237-249.
  9. C.Y.Wang,Y.Y.Chen and S.Q.Du, Further insight into the Shamanskii modification of Newton method, Appl. Math. Comput. 180 (2006), 46-52. https://doi.org/10.1016/j.amc.2005.11.167
  10. X. J.Zhang and A. N.Xu, Global convergence properties of a new class of nonlinear conjugate gradient methods, Guangxi Science 12 (2005), 282-283.
  11. Y.H. Dai, Conjugate gradient methods with Armijo-type line search, Acta Mathematicae Applicatae Sinica (2002), 123-130.
  12. Y.H. Dai and Y.X. Yuan, Nonlinear conjugate gradient methods, Shanghai Scientic and Technical Publishers, Shanghai, 2000.
  13. A. Fischer, Solution of monotone complementarity problems with locally lipschitzian functions, Mathematical Programming 76 (1997), 513-532.
  14. M.C.Ferris, O.L.Mangasarian and J.S. Pang, Complementarity: Applications, Algorithms and Extensions, Kluwer Academic, Dordrecht, 2001.
  15. F.Facchinei and J.S. Pang, Finite-dimensional variational inequalities and complementarity problem, Volume I-II, Springer, New York, 2003.
  16. M.Dehghan and M.Hajarian, Convergence of SSOR methods for linear complementarity problems, Operations Research Letters 37 (2009), 219-223. https://doi.org/10.1016/j.orl.2009.01.013
  17. Y.Elfoutayeni and M.Khaladi, Using vector divisions in solving the linear complementarity problem, Journal of Computational and Applied Mathematics 236 (2012), 1919-1925. https://doi.org/10.1016/j.cam.2011.11.001

피인용 문헌

  1. A modified Levenberg–Marquardt method with line search for nonlinear equations vol.65, pp.3, 2016, https://doi.org/10.1007/s10589-016-9852-y
  2. RcdMathLib: An Open Source Software Library for Computing on Resource-Limited Devices vol.21, pp.5, 2021, https://doi.org/10.3390/s21051689