- Journal Home
- Volume 18 - 2025
- Volume 17 - 2024
- Volume 16 - 2023
- Volume 15 - 2022
- Volume 14 - 2021
- Volume 13 - 2020
- Volume 12 - 2019
- Volume 11 - 2018
- Volume 10 - 2017
- Volume 9 - 2016
- Volume 8 - 2015
- Volume 7 - 2014
- Volume 6 - 2013
- Volume 5 - 2012
- Volume 4 - 2011
- Volume 3 - 2010
- Volume 2 - 2009
- Volume 1 - 2008
Numer. Math. Theor. Meth. Appl., 12 (2019), pp. 154-168.
Published online: 2018-09
Cited by
- BibTex
- RIS
- TXT
As applying the Levenberg-Marquardt method to the reformulation of linear complementarity problem, a modulus-based Levenberg-Marquardt method with non-monotone line search is established and the global convergence result is presented. Numerical experiments show that the proposed method is efficient and outperforms the modulus-based matrix splitting iteration method.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.OA-2017-0135}, url = {http://global-sci.org/intro/article_detail/nmtma/12695.html} }As applying the Levenberg-Marquardt method to the reformulation of linear complementarity problem, a modulus-based Levenberg-Marquardt method with non-monotone line search is established and the global convergence result is presented. Numerical experiments show that the proposed method is efficient and outperforms the modulus-based matrix splitting iteration method.