General convergence results of the modulus-based methods for vertical nonlinear complementarity problems
In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with H -matrices is proposed, which can extend the existing results given in Xie et al. (J Appl Math Comput 69: 2987–3003, 2023). Moreover, the propos...
Saved in:
Published in | Computational & applied mathematics Vol. 43; no. 4 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Cham
Springer International Publishing
01.06.2024
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with
H
-matrices is proposed, which can extend the existing results given in Xie et al. (J Appl Math Comput 69: 2987–3003, 2023). Moreover, the proposed conditions are much simpler and easier to check. Finally, the effectiveness of the theoretical results are verified by numerical examples. The proposed results can enrich the convergence theory and enlarge the application spectrum of the modulus-based methods. |
---|---|
AbstractList | In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with H-matrices is proposed, which can extend the existing results given in Xie et al. (J Appl Math Comput 69: 2987–3003, 2023). Moreover, the proposed conditions are much simpler and easier to check. Finally, the effectiveness of the theoretical results are verified by numerical examples. The proposed results can enrich the convergence theory and enlarge the application spectrum of the modulus-based methods. In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with H -matrices is proposed, which can extend the existing results given in Xie et al. (J Appl Math Comput 69: 2987–3003, 2023). Moreover, the proposed conditions are much simpler and easier to check. Finally, the effectiveness of the theoretical results are verified by numerical examples. The proposed results can enrich the convergence theory and enlarge the application spectrum of the modulus-based methods. |
ArticleNumber | 163 |
Author | Zheng, Hua Lu, Xiaoping Kong, Yuting |
Author_xml | – sequence: 1 givenname: Yuting surname: Kong fullname: Kong, Yuting organization: School of Computers, Guangdong University of Science and Technology – sequence: 2 givenname: Xiaoping surname: Lu fullname: Lu, Xiaoping organization: School of Computer Science and Engineering, Macau University of Science and Technology – sequence: 3 givenname: Hua orcidid: 0000-0002-2822-0078 surname: Zheng fullname: Zheng, Hua email: hzheng@sgu.edu.cn organization: School of Mathematics and Statistics, Shaoguan University |
BookMark | eNp9kE1LAzEQhoNUsK3-AU8Bz6uTj262RylahYIHvYdsMtsPdpOa7Ar996au4M3DEAbe553wzMjEB4-E3DK4ZwDqIUkQTBbAz1MuRVFdkCmrQBUggE_IlHNRFaIEcUVmKR0AhGJSTslujR6jaakN_gvjFr1FGjENbZ9oaGi_Q9oFN7RDKmqT0NEO-11wiTYh0kz0e5vp_J1279HE3NMdW-zQ9ybu-xM9xlDnPV2Ty8a0CW9-3zl5f376WL0Um7f16-pxU1iuoC-sNEouAWrkAlWjnDNugY5XHGvFjLFNbRrpzMKK0oGUpeWGgeOlLXnZiDm5G1vz2c8BU68PYYg-H9QChMx5yHbmhI8pG0NKERt9jPvOxJNmoM8-9ehTZ5_6x6euMiRGKOWw32L8q_6H-gZIEH1y |
Cites_doi | 10.1002/nla.680 10.1007/BF02061065 10.1016/S0021-9800(70)80010-2 10.1002/nla.2044 10.1007/s40314-018-0687-2 10.1016/j.jedc.2007.04.010 10.1007/s40314-022-01842-1 10.1115/1.3261274 10.1007/s12190-023-01866-8 10.1137/1.9781611971262 10.1016/j.cam.2022.114241 10.1007/s11590-023-01980-3 10.1007/s11075-022-01436-2 10.1016/0024-3795(93)00184-2 10.1007/s10957-021-01922-y 10.1007/s11075-018-0484-4 10.1007/s11590-021-01781-6 10.1007/BF01385865 10.1137/S0895479892237859 10.1007/s11075-019-00677-y 10.1016/j.aml.2022.108444 10.1137/S0895479897324032 10.1080/02331934.2022.2069021 10.1016/j.camwa.2019.06.012 10.1007/s11075-021-01240-4 10.1016/j.amc.2015.08.108 10.1016/j.amc.2023.128248 10.1137/0122030 10.1016/j.aml.2022.108344 10.1016/0024-3795(89)90074-8 10.1080/10556788.2023.2278090 10.1007/s42967-023-00280-y |
ContentType | Journal Article |
Copyright | The Author(s) under exclusive licence to Sociedade Brasileira de Matemática Aplicada e Computacional 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
Copyright_xml | – notice: The Author(s) under exclusive licence to Sociedade Brasileira de Matemática Aplicada e Computacional 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. |
DBID | AAYXX CITATION |
DOI | 10.1007/s40314-024-02693-8 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Applied Sciences Mathematics |
EISSN | 1807-0302 |
ExternalDocumentID | 10_1007_s40314_024_02693_8 |
GrantInformation_xml | – fundername: Science and Technology Development Fund grantid: 0096/2022/A funderid: http://dx.doi.org/10.13039/501100003009 – fundername: Guangdong Key Construction Discipline Research Capacity Enhancement Project grantid: 2022ZDJS049 – fundername: Technology Planning Project of Shaoguan grantid: 230330108034184 – fundername: National Natural Science Foundation of China grantid: 51474095 funderid: http://dx.doi.org/10.13039/501100001809 – fundername: Scientific Computing Research Innovation Team of Guangdong Province grantid: 2021KCXTD052 |
GroupedDBID | -EM .4S .DC 06D 0R~ 203 29F 2WC 30V 4.4 406 5GY 69Q 96X AAAVM AACDK AAHNG AAIAL AAJBT AAJKR AAKPC AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAZMS ABAKF ABDZT ABECU ABFTV ABJNI ABJOX ABKCH ABMQK ABQBU ABTEG ABTHY ABTKH ABTMW ABXHO ABXPI ACAOD ACCUX ACDTI ACGFO ACGFS ACHSB ACIPV ACIWK ACKNC ACMLO ACOKC ACPIV ACREN ACZOJ ADBBV ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGNC AEGXH AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETCA AEVLU AEXYK AFBBN AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGMZJ AGQEE AGQMX AGRTI AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AIAGR AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKLTO ALFXC ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AMXSW AMYLF AMYQR ANMIH APOWU ARCSS ASPBG AUKKA AVWKF AXYYD AYJHY AZFZN BAPOH BGNMA C1A CS3 CSCUP DNIVK DPUIP DU5 E3Z EBLON EBS EDO EIOEI EJD ESBYG FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FYJPI GGCAI GGRSB GJIRD GQ7 HMJXF HRMNR HZ~ I0C IKXTQ IWAJR IXD J-C JBSCW JZLTJ KOV KQ8 KWQ LLZTM M4Y M~E NPVJJ NQJWS NU0 O9- O93 O9G O9J OK1 P2P PT4 RLLFE RNS ROL RSC RSV SCD SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE TR2 TSG UG4 UOJIU UTJUX UZXMN VFIZW W48 XSB Z7R Z83 ZMTXR AAYXX ABBRH ABDBE ABFSG ACMFV ACSTC AEZWR AFDZB AFHIU AFOHR AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION OVT ABRTQ |
ID | FETCH-LOGICAL-c270t-c4a74900be23e7f7ddad5ed282eb71aacfbaf4da5c36d0446c2a10d26c626f3 |
IEDL.DBID | AGYKE |
ISSN | 2238-3603 |
IngestDate | Fri Jul 25 10:41:42 EDT 2025 Tue Jul 01 00:46:09 EDT 2025 Fri Feb 21 02:41:28 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Keywords | Vertical nonlinear complementarity problem Modulus-based method 65F10 matrix 90C33 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c270t-c4a74900be23e7f7ddad5ed282eb71aacfbaf4da5c36d0446c2a10d26c626f3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ORCID | 0000-0002-2822-0078 |
PQID | 3034446069 |
PQPubID | 2044245 |
ParticipantIDs | proquest_journals_3034446069 crossref_primary_10_1007_s40314_024_02693_8 springer_journals_10_1007_s40314_024_02693_8 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2024-06-01 |
PublicationDateYYYYMMDD | 2024-06-01 |
PublicationDate_xml | – month: 06 year: 2024 text: 2024-06-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | Cham |
PublicationPlace_xml | – name: Cham – name: Heidelberg |
PublicationTitle | Computational & applied mathematics |
PublicationTitleAbbrev | Comp. Appl. Math |
PublicationYear | 2024 |
Publisher | Springer International Publishing Springer Nature B.V |
Publisher_xml | – name: Springer International Publishing – name: Springer Nature B.V |
References | Cottle, Dantzig (CR4) 1970; 8 Ke, Ma, Zhang (CR20) 2018; 37 Bai (CR2) 2010; 17 Zheng, Zhang, Lu, Vong (CR35) 2023; 93 CR36 Gowda, Sznajder (CR14) 1994; 15 Hong, Li (CR17) 2016; 23 Ke, Ma, Zhang (CR19) 2018; 79 Mezzadri, Galligani (CR25) 2022; 193 Oh (CR27) 1986; 108 Fang, Zhu (CR9) 2019; 78 Bai (CR1) 1999; 21 Sznajder, Gowda (CR29) 1995; 223 Frommer, Mayer (CR11) 1989; 119 Li, Wu (CR22) 2023; 72 Mezzadri (CR23) 2022; 90 Hu (CR18) 1982; 3 Wu (CR30) 2023; 17 Fang, Gu, Qiao (CR10) 2023; 13 Frommer, Szyld (CR12) 1992; 63 Wu, Li (CR31) 2022; 16 Nagae, Akamatsu (CR26) 2008; 32 Xia, Li (CR32) 2015; 271 Zhang, Zheng, Lu, Vong (CR34) 2023; 458 Ebiefung, Kostreva (CR6) 1993; 44 Mezzadri, Galligani (CR24) 2020; 83 Fujisawa, Kuh (CR13) 1972; 22 CR21 Sun (CR28) 1989; 19 Cottle, Pang, Stone (CR5) 1992 Xie, Yang, Xu (CR33) 2023; 69 Berman, Plemmons (CR3) 1994 Fang (CR8) 2022; 411 He, Vong (CR16) 2022; 134 Fang (CR7) 2022; 41 Guo, Zheng, Peng (CR15) 2023; 135 W-X Guo (2693_CR15) 2023; 135 X-M Fang (2693_CR8) 2022; 411 J-W He (2693_CR16) 2022; 134 X-M Fang (2693_CR9) 2019; 78 S-L Wu (2693_CR30) 2023; 17 J-G Hu (2693_CR18) 1982; 3 R Sznajder (2693_CR29) 1995; 223 AA Ebiefung (2693_CR6) 1993; 44 MS Gowda (2693_CR14) 1994; 15 Y-X Zhang (2693_CR34) 2023; 458 Z-C Xia (2693_CR32) 2015; 271 J-T Hong (2693_CR17) 2016; 23 2693_CR36 T Nagae (2693_CR26) 2008; 32 F Mezzadri (2693_CR23) 2022; 90 T Fujisawa (2693_CR13) 1972; 22 X-M Fang (2693_CR7) 2022; 41 RW Cottle (2693_CR5) 1992 F Mezzadri (2693_CR25) 2022; 193 H Zheng (2693_CR35) 2023; 93 M Sun (2693_CR28) 1989; 19 S-L Xie (2693_CR33) 2023; 69 Y-F Ke (2693_CR19) 2018; 79 A Frommer (2693_CR11) 1989; 119 S-L Wu (2693_CR31) 2022; 16 2693_CR21 C-X Li (2693_CR22) 2023; 72 X-M Fang (2693_CR10) 2023; 13 F Mezzadri (2693_CR24) 2020; 83 Y-F Ke (2693_CR20) 2018; 37 A Berman (2693_CR3) 1994 Z-Z Bai (2693_CR2) 2010; 17 RW Cottle (2693_CR4) 1970; 8 KP Oh (2693_CR27) 1986; 108 A Frommer (2693_CR12) 1992; 63 Z-Z Bai (2693_CR1) 1999; 21 |
References_xml | – volume: 17 start-page: 917 year: 2010 end-page: 933 ident: CR2 article-title: Modulus-based matrix splitting iteration methods for linear complementarity problems publication-title: Numer Linear Algebra Appl doi: 10.1002/nla.680 – volume: 44 start-page: 161 year: 1993 end-page: 172 ident: CR6 article-title: The generalized Leontief input-output model and its application to the choice of the new technology publication-title: Ann Oper Res doi: 10.1007/BF02061065 – volume: 8 start-page: 79 year: 1970 end-page: 90 ident: CR4 article-title: A generalization of the linear complementarity problem publication-title: J Combin Theory doi: 10.1016/S0021-9800(70)80010-2 – volume: 23 start-page: 629 issue: 4 year: 2016 end-page: 641 ident: CR17 article-title: Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems publication-title: Numer Linear Algebra Appl doi: 10.1002/nla.2044 – volume: 19 start-page: 571 year: 1989 end-page: 584 ident: CR28 article-title: Monotonicity of Mangasarian’s iterative algorithm for generalized linear complementarity problems publication-title: J Math Anal Appl – volume: 37 start-page: 6795 year: 2018 end-page: 6820 ident: CR20 article-title: The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems publication-title: Comput Appl Math doi: 10.1007/s40314-018-0687-2 – volume: 32 start-page: 1754 year: 2008 end-page: 1779 ident: CR26 article-title: A generalized complementarity approach to solving real option problems publication-title: J Econ Dyn Control doi: 10.1016/j.jedc.2007.04.010 – volume: 41 start-page: 134 year: 2022 ident: CR7 article-title: The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems publication-title: Comput Appl Math doi: 10.1007/s40314-022-01842-1 – volume: 108 start-page: 598 year: 1986 end-page: 604 ident: CR27 article-title: The formulation of the mixed lubrication problem as a generalized nonlinear complementarity problem publication-title: J Tribol doi: 10.1115/1.3261274 – volume: 69 start-page: 2987 year: 2023 end-page: 3003 ident: CR33 article-title: A modulus-based matrix splitting method for the vertical nonlinear complementarity problem publication-title: J Appl Math Comput doi: 10.1007/s12190-023-01866-8 – year: 1994 ident: CR3 publication-title: Nonnegative matrix in the mathematical sciences doi: 10.1137/1.9781611971262 – year: 1992 ident: CR5 publication-title: The linear complementarity problem – volume: 411 year: 2022 ident: CR8 article-title: The convergence of modulus-based matrix splitting iteration methods for implicit complementarity problems publication-title: J Comput Appl Math doi: 10.1016/j.cam.2022.114241 – volume: 17 start-page: 1669 year: 2023 end-page: 1678 ident: CR30 article-title: On the new modulus-based matrix splitting method for linear complementarity problem of -matrix publication-title: Optim Lett doi: 10.1007/s11590-023-01980-3 – volume: 93 start-page: 711 year: 2023 end-page: 729 ident: CR35 article-title: Modulus-based synchronous multisplitting iteration methods for large sparse vertical linear complementarity problems publication-title: Numer Algorithms doi: 10.1007/s11075-022-01436-2 – volume: 223 start-page: 695 issue: 224 year: 1995 end-page: 715 ident: CR29 article-title: Generalizations of - and -properties; extended vertical and horizontal linear complementarity problems publication-title: Linear Algebra Appl doi: 10.1016/0024-3795(93)00184-2 – volume: 193 start-page: 598 issue: 1 year: 2022 end-page: 620 ident: CR25 article-title: Projected splitting methods for vertical linear complementarity problems publication-title: J Optim Theory Appl doi: 10.1007/s10957-021-01922-y – ident: CR21 – volume: 79 start-page: 1283 year: 2018 end-page: 1303 ident: CR19 article-title: The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems publication-title: Numer Algorithms doi: 10.1007/s11075-018-0484-4 – volume: 16 start-page: 1427 year: 2022 end-page: 1443 ident: CR31 article-title: A class of new modulus-based matrix splitting iteration methods for linear complementarity problems publication-title: Optim Lett doi: 10.1007/s11590-021-01781-6 – volume: 63 start-page: 345 year: 1992 end-page: 356 ident: CR12 article-title: -splittings and two-stage iterative methods publication-title: Numer Math doi: 10.1007/BF01385865 – volume: 15 start-page: 779 year: 1994 end-page: 795 ident: CR14 article-title: The generalized order linear complementarity problem publication-title: SIAM J Matrix Anal Appl doi: 10.1137/S0895479892237859 – volume: 83 start-page: 201 year: 2020 end-page: 219 ident: CR24 article-title: Modulus-based matrix splitting methods for horizontal linear complementarity problems publication-title: Numer Algorithms doi: 10.1007/s11075-019-00677-y – volume: 3 start-page: 272 year: 1982 end-page: 282 ident: CR18 article-title: Estimates of and their applications publication-title: Math Numer Sin – volume: 135 year: 2023 ident: CR15 article-title: New convergence results of the modulus-based methods for vertical linear complementarity problems publication-title: Appl Math Lett doi: 10.1016/j.aml.2022.108444 – volume: 21 start-page: 67 year: 1999 end-page: 78 ident: CR1 article-title: On the convergence of the multisplitting methods for the linear complementarity problem publication-title: SIAM J Matrix Anal Appl doi: 10.1137/S0895479897324032 – volume: 72 start-page: 2499 year: 2023 end-page: 2516 ident: CR22 article-title: A class of modulus-based matrix splitting methods for vertical linear complementarity problems publication-title: Optimization doi: 10.1080/02331934.2022.2069021 – volume: 78 start-page: 3633 year: 2019 end-page: 3643 ident: CR9 article-title: The modulus-based matrix double splitting iteration method for linear complementarity problems publication-title: Comput Math Appl doi: 10.1016/j.camwa.2019.06.012 – volume: 90 start-page: 1547 year: 2022 end-page: 1568 ident: CR23 article-title: A modulus-based formulation for the vertical linear complementarity problems publication-title: Numer Algorithms doi: 10.1007/s11075-021-01240-4 – volume: 271 start-page: 34 year: 2015 end-page: 42 ident: CR32 article-title: Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem publication-title: Appl Math Comput doi: 10.1016/j.amc.2015.08.108 – volume: 458 year: 2023 ident: CR34 article-title: Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems publication-title: Appl Math Comput doi: 10.1016/j.amc.2023.128248 – ident: CR36 – volume: 22 start-page: 307 year: 1972 end-page: 328 ident: CR13 article-title: Piecewise-linear theory of nonlinear networks publication-title: SIAM J Appl Math doi: 10.1137/0122030 – volume: 134 year: 2022 ident: CR16 article-title: A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems publication-title: Appl Math Lett doi: 10.1016/j.aml.2022.108344 – volume: 13 start-page: 2504 issue: 5 year: 2023 end-page: 2521 ident: CR10 article-title: Convergence of the two-point modulus-based matrix splitting iteration method publication-title: J Appl Anal Comput – volume: 119 start-page: 141 year: 1989 end-page: 152 ident: CR11 article-title: Convergence of relaxed parallel multisplitting methods publication-title: Linear Algebra Appl doi: 10.1016/0024-3795(89)90074-8 – volume: 37 start-page: 6795 year: 2018 ident: 2693_CR20 publication-title: Comput Appl Math doi: 10.1007/s40314-018-0687-2 – volume: 135 year: 2023 ident: 2693_CR15 publication-title: Appl Math Lett doi: 10.1016/j.aml.2022.108444 – volume: 90 start-page: 1547 year: 2022 ident: 2693_CR23 publication-title: Numer Algorithms doi: 10.1007/s11075-021-01240-4 – volume: 93 start-page: 711 year: 2023 ident: 2693_CR35 publication-title: Numer Algorithms doi: 10.1007/s11075-022-01436-2 – volume: 119 start-page: 141 year: 1989 ident: 2693_CR11 publication-title: Linear Algebra Appl doi: 10.1016/0024-3795(89)90074-8 – volume: 8 start-page: 79 year: 1970 ident: 2693_CR4 publication-title: J Combin Theory doi: 10.1016/S0021-9800(70)80010-2 – volume: 69 start-page: 2987 year: 2023 ident: 2693_CR33 publication-title: J Appl Math Comput doi: 10.1007/s12190-023-01866-8 – volume: 13 start-page: 2504 issue: 5 year: 2023 ident: 2693_CR10 publication-title: J Appl Anal Comput – volume: 22 start-page: 307 year: 1972 ident: 2693_CR13 publication-title: SIAM J Appl Math doi: 10.1137/0122030 – volume: 63 start-page: 345 year: 1992 ident: 2693_CR12 publication-title: Numer Math doi: 10.1007/BF01385865 – volume: 72 start-page: 2499 year: 2023 ident: 2693_CR22 publication-title: Optimization doi: 10.1080/02331934.2022.2069021 – volume: 23 start-page: 629 issue: 4 year: 2016 ident: 2693_CR17 publication-title: Numer Linear Algebra Appl doi: 10.1002/nla.2044 – volume: 193 start-page: 598 issue: 1 year: 2022 ident: 2693_CR25 publication-title: J Optim Theory Appl doi: 10.1007/s10957-021-01922-y – volume: 17 start-page: 1669 year: 2023 ident: 2693_CR30 publication-title: Optim Lett doi: 10.1007/s11590-023-01980-3 – volume: 108 start-page: 598 year: 1986 ident: 2693_CR27 publication-title: J Tribol doi: 10.1115/1.3261274 – ident: 2693_CR21 doi: 10.1080/10556788.2023.2278090 – volume: 17 start-page: 917 year: 2010 ident: 2693_CR2 publication-title: Numer Linear Algebra Appl doi: 10.1002/nla.680 – volume: 134 year: 2022 ident: 2693_CR16 publication-title: Appl Math Lett doi: 10.1016/j.aml.2022.108344 – volume: 411 year: 2022 ident: 2693_CR8 publication-title: J Comput Appl Math doi: 10.1016/j.cam.2022.114241 – volume: 32 start-page: 1754 year: 2008 ident: 2693_CR26 publication-title: J Econ Dyn Control doi: 10.1016/j.jedc.2007.04.010 – volume: 271 start-page: 34 year: 2015 ident: 2693_CR32 publication-title: Appl Math Comput doi: 10.1016/j.amc.2015.08.108 – volume: 16 start-page: 1427 year: 2022 ident: 2693_CR31 publication-title: Optim Lett doi: 10.1007/s11590-021-01781-6 – ident: 2693_CR36 doi: 10.1007/s42967-023-00280-y – volume: 41 start-page: 134 year: 2022 ident: 2693_CR7 publication-title: Comput Appl Math doi: 10.1007/s40314-022-01842-1 – volume: 79 start-page: 1283 year: 2018 ident: 2693_CR19 publication-title: Numer Algorithms doi: 10.1007/s11075-018-0484-4 – volume: 15 start-page: 779 year: 1994 ident: 2693_CR14 publication-title: SIAM J Matrix Anal Appl doi: 10.1137/S0895479892237859 – volume: 223 start-page: 695 issue: 224 year: 1995 ident: 2693_CR29 publication-title: Linear Algebra Appl doi: 10.1016/0024-3795(93)00184-2 – volume: 78 start-page: 3633 year: 2019 ident: 2693_CR9 publication-title: Comput Math Appl doi: 10.1016/j.camwa.2019.06.012 – volume: 19 start-page: 571 year: 1989 ident: 2693_CR28 publication-title: J Math Anal Appl – volume-title: Nonnegative matrix in the mathematical sciences year: 1994 ident: 2693_CR3 doi: 10.1137/1.9781611971262 – volume-title: The linear complementarity problem year: 1992 ident: 2693_CR5 – volume: 3 start-page: 272 year: 1982 ident: 2693_CR18 publication-title: Math Numer Sin – volume: 21 start-page: 67 year: 1999 ident: 2693_CR1 publication-title: SIAM J Matrix Anal Appl doi: 10.1137/S0895479897324032 – volume: 44 start-page: 161 year: 1993 ident: 2693_CR6 publication-title: Ann Oper Res doi: 10.1007/BF02061065 – volume: 83 start-page: 201 year: 2020 ident: 2693_CR24 publication-title: Numer Algorithms doi: 10.1007/s11075-019-00677-y – volume: 458 year: 2023 ident: 2693_CR34 publication-title: Appl Math Comput doi: 10.1016/j.amc.2023.128248 |
SSID | ssj0037144 |
Score | 2.265124 |
Snippet | In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with
H... In this work, the general convergence analysis of the modulus-based matrix splitting iteration method for vertical nonlinear complementarity problems with... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Index Database Publisher |
SubjectTerms | Applications of Mathematics Computational Mathematics and Numerical Analysis Convergence Mathematical Applications in Computer Science Mathematical Applications in the Physical Sciences Mathematics Mathematics and Statistics |
Title | General convergence results of the modulus-based methods for vertical nonlinear complementarity problems |
URI | https://link.springer.com/article/10.1007/s40314-024-02693-8 https://www.proquest.com/docview/3034446069 |
Volume | 43 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8QwDLbgboGBN-KtDGwQlGvS1wiI4wS6WwAJpirNQ0gcD9F24dfjpOkhEAwMnRqlbezks2v7M8AhokYcW2spL7WgiHiM5iZXNHVEK9FAZczzzI4nyehOXN3H96EorOqy3buQpD-pZ8VuwjGtU8QUvJKc02we-mh_MNGD_unlw_VFdwI7EjoXTUbkyyhPGA_FMr_P8h2QvqzMH4FRjzfDZbjr3rRNM3k6aeryRH38IHH876eswFIwQMlpqzGrMGde1mA5GKMkbPVqDRbHM0LXah0eAz018VnqvmDTEPTUm2ldkVdLcCh5ftXNtKmoA0ZN2tbUFUGjmPiez6gM5KUl5pDvxKeyt5nrrn0eCY1tqg24GV7cno9oaNJAVZSymiohU5EzVpqIm9SmWksdG42enCnTgZTKltIKLWPFE-2ixyqSA6ajRKErZfkm9PDRZguISVmWaiWU0BbNhlJKkSRRPpCJLTkeFNtw1MmpeGuZOIoZ57Jf0AIXtPALWmTbsNeJsgi7siq44zcU6LLhZMedZL5u_z3bzv-G78JC5IXrftbsQa9-b8w-2i51eYCqOjw7mxwElf0EwEDnyw |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED5BOwADb0ShgAc2MEpj5zUiVCiUsgASTJHjh5B4iiQLv56z4xSBYGDIFMtJfGd_d7m77wD2ETWiyBhDWaE4RcQLaKYzSRNLtBIOZBo4ntnJVTy65Rd30Z0vCivbbPc2JOlO6mmxG7dM6xQxBa84YzSdhS5HHxz1unt8dj8etiewJaGz0WREvpSyOGC-WOb3Wb4D0peV-SMw6vDmdAlu2zdt0kwej-qqOJIfP0gc__spy7DoDVBy3GjMCszol1VY8sYo8Vu9XIWFyZTQtVyDB09PTVyWuivY1AQ99fqpKsmrITiUPL-q-qkuqQVGRZrW1CVBo5i4ns-oDOSlIeYQ78SlsjeZ67Z9HvGNbcp1uD4d3pyMqG_SQGWYBBWVXCQ8C4JCh0wnJlFKqEgr9OR0kQyEkKYQhisRSRYrGz2WoRgEKowlulKGbUAHH603gegkSBMlueTKoNlQCMHjOMwGIjYFw4OiBwetnPK3hokjn3IuuwXNcUFzt6B52oN-K8rc78oyZ5bfkKPLhpMdtpL5uv33bFv_G74Hc6ObyWV-eX413ob50Ana_rjpQ6d6r_UO2jFVsevV9hOC0-k- |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8QwDLbgkBAMHE_xOCADGwR6TdpeRwQcb4QESDBVaR5CAg5E24Vfj5Omx0MwIIZOjdLWTvPZsf0ZYANRI4qMMZTlilNEvICmOpU0sUQrYVf2Ascze34RH93wk9vo9lMVv8t2b0KSdU2DZWkalDsvyuwMC9-4ZV2niC94xSmjvVEY45bbrgVju4d3pwfNbmwJ6WxkGVGwR1kcMF848_MsX8Hpw-L8FiR12NNvg2jeuk45ediuynxbvn0jdPzPZ03DlDdMyW69kmZgRA9moe2NVOK3gGIWJs-HRK_FHNx72mristddIacm6MFXj2VBng3BoeTpWVWPVUEtYCpSt6wuCBrLxPWCxkVCBjVhh3glLsW9zmi3bfWIb3hTzMNV_-B674j65g1UhklQUslFwtMgyHXIdGISpYSKtEIPT-dJVwhpcmG4EpFksbJRZRmKbqDCWKKLZdgCtPDRehGITlCvSnLJlUFzIheCx3GYdkVscoYbyBJsNjrLXmqGjmzIxewEmqFAMyfQrLcEnUatmf9bi4xZ3kOOrhxOttVo6eP277Mt_234Ooxf7vezs-OL0xWYCJ2e7XlOB1rla6VX0bwp8zW_gt8BcW7yIg |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=General+convergence+results+of+the+modulus-based+methods+for+vertical+nonlinear+complementarity+problems&rft.jtitle=Computational+%26+applied+mathematics&rft.au=Kong+Yuting&rft.au=Lu%2C+Xiaoping&rft.au=Zheng%2C+Hua&rft.date=2024-06-01&rft.pub=Springer+Nature+B.V&rft.issn=2238-3603&rft.eissn=1807-0302&rft.volume=43&rft.issue=4&rft_id=info:doi/10.1007%2Fs40314-024-02693-8&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2238-3603&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2238-3603&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2238-3603&client=summon |