- Journal Home
- Volume 19 - 2024
- 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
Jacobian consistency property analysis for generalized complementarity problems
J. Info. Comput. Sci. , 8 (2013), pp. 115-118.
[An open-access article; the PDF is free to any online user.]
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{JICS-8-115,
author = {Shou-qiang Du},
title = {Jacobian consistency property analysis for generalized complementarity problems},
journal = {Journal of Information and Computing Science},
year = {2013},
volume = {8},
number = {2},
pages = {115--118},
abstract = { In this paper, we present the Jacobian consistency property for generalized complementarity
problems. The idea is based on a nonsmooth system of equations reformulation of the generalized
complementarity problem and a smoothing approximation function for solving the nonsmooth system of
equations.
},
issn = {3080-180X},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22620.html}
}
TY - JOUR
T1 - Jacobian consistency property analysis for generalized complementarity problems
AU - Shou-qiang Du
JO - Journal of Information and Computing Science
VL - 2
SP - 115
EP - 118
PY - 2013
DA - 2013/06
SN - 8
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22620.html
KW -
approximation function
AB - In this paper, we present the Jacobian consistency property for generalized complementarity
problems. The idea is based on a nonsmooth system of equations reformulation of the generalized
complementarity problem and a smoothing approximation function for solving the nonsmooth system of
equations.
Shou-qiang Du. (2013). Jacobian consistency property analysis for generalized complementarity problems.
Journal of Information and Computing Science. 8 (2).
115-118.
doi:
Copy to clipboard