- Journal Home
- Volume 18 - 2023
- Volume 17 - 2022
- Volume 16 - 2021
- Volume 15 - 2020
- Volume 14 - 2019
- Volume 13 - 2018
- Volume 12 - 2017
- Volume 11 - 2016
- Volume 10 - 2015
- Volume 9 - 2014
- Volume 8 - 2013
- Volume 7 - 2012
- Volume 6 - 2011
- Volume 5 - 2010
- Volume 4 - 2009
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
A nonsmooth Levenberg-Marquardt method for generalized complementarity problem
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-7-267,
author = {Shou-qiang Du},
title = {A nonsmooth Levenberg-Marquardt method for generalized complementarity problem},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {7},
number = {4},
pages = {267--271},
abstract = { A new method for the solution of the generalized complementarily problem is introduced. The
method is based on a no smooth equation reformulation of the generalized complementarily problem and on a
no smooth Levenberg-Marquardt method for its solution. The method is shown to be globally convergent.
Numerical results are also given.
},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22633.html}
}
TY - JOUR
T1 - A nonsmooth Levenberg-Marquardt method for generalized complementarity problem
AU - Shou-qiang Du
JO - Journal of Information and Computing Science
VL - 4
SP - 267
EP - 271
PY - 2024
DA - 2024/01
SN - 7
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22633.html
KW - Nonsmooth Levenberg-Marquardt method
KW - generalized complementarity problem
KW - global
convergence.
AB - A new method for the solution of the generalized complementarily problem is introduced. The
method is based on a no smooth equation reformulation of the generalized complementarily problem and on a
no smooth Levenberg-Marquardt method for its solution. The method is shown to be globally convergent.
Numerical results are also given.
Shou-qiang Du. (2024). A nonsmooth Levenberg-Marquardt method for generalized complementarity problem.
Journal of Information and Computing Science. 7 (4).
267-271.
doi:
Copy to clipboard