Strict feasibility for the polynomial complementarity problem
In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor tuples are investigated. In particular, several conditions...
Saved in:
| Published in | Journal of global optimization Vol. 89; no. 1; pp. 57 - 71 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.05.2024
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor tuples are investigated. In particular, several conditions are proposed to judge whether a tensor tuple is an S-tensor tuple or not. Then, based on the S-tensor tuple, the strict feasibility of PCP is investigated. |
|---|---|
| AbstractList | In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept of S-tensor, a concept of S-tensor tuple is introduced. Some properties of S-tensor tuples are investigated. In particular, several conditions are proposed to judge whether a tensor tuple is an S-tensor tuple or not. Then, based on the S-tensor tuple, the strict feasibility of PCP is investigated. |
| Author | Tang, Guo-ji Li, Xue-liu |
| Author_xml | – sequence: 1 givenname: Xue-liu surname: Li fullname: Li, Xue-liu organization: School of Mathematics and Physics, Guangxi Minzu University – sequence: 2 givenname: Guo-ji orcidid: 0000-0001-9869-9291 surname: Tang fullname: Tang, Guo-ji email: guojvtang@126.com organization: School of Mathematics and Physics, Center for Applied Mathematics of Guangxi, Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi Minzu University |
| BookMark | eNp9kE1LAzEURYNUsK3-AVcDrqMvySQzWbiQ4hcUXKjrkKQZnTIzGZN00f56U0dw5-rx4Nx74SzQbPCDQ-iSwDUBqG4igVrWGCjDQBiT-HCC5oRXDFNJxAzNQVKOOQA5Q4sYtwAga07n6PY1hdamonE6tqbt2rQvGh-K9OmK0Xf7wfet7grr-7FzvRuSDkdkDN7k_xydNrqL7uL3LtH7w_3b6gmvXx6fV3drbGkFCZcNZ5SQ2lnDra0ICK1LcMDkpgTYMFYZYYzmWvNaSieEbgSUoIVmpWPGsCW6mnrz7tfOxaS2fheGPKkYlBWAkCAyRSfKBh9jcI0aQ9vrsFcE1FGTmjSprEn9aFKHHGJTKGZ4-HDhr_qf1DdOom1l |
| Cites_doi | 10.1007/s10957-016-0903-4 10.1007/s11590-023-02004-w 10.1142/S0217595919400025 10.1080/03081087.2018.1430737 10.1007/s11590-022-01850-4 10.1007/s10957-023-02169-5 10.1007/s10957-018-1356-8 10.1007/s10957-021-01969-x 10.1007/s10957-021-01960-6 10.1007/s10957-021-01917-9 10.1007/s11590-016-1104-7 10.1007/s11590-020-01697-7 10.1007/s10589-016-9872-7 10.1007/s10957-016-0907-0 10.1137/S0036144595285963 10.1007/s10898-023-01298-5 10.1007/s10957-021-01972-2 10.1007/s10589-022-00382-y 10.1007/s12190-023-01868-6 10.1007/s10957-014-0616-5 10.1080/02331934.2017.1391254 10.3934/era.2022111 10.1007/s10589-019-00144-3 10.1007/s10898-022-01263-8 10.1007/s10957-019-01596-7 10.1007/s10957-019-01573-0 10.1007/s10957-018-1441-z 10.1007/s10589-019-00162-1 10.1007/s10957-020-01645-6 10.1007/s10957-017-1205-1 10.1007/s11590-019-01461-6 10.1007/s10957-017-1212-2 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. 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 Springer Science+Business Media, LLC, part of Springer Nature 2023. 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 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2O M2P M7S MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1007/s10898-023-01339-z |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Research Library Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Research Library Science Database (ProQuest) Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Sciences (General) Computer Science |
| EISSN | 1573-2916 |
| EndPage | 71 |
| ExternalDocumentID | 10_1007_s10898_023_01339_z |
| GrantInformation_xml | – fundername: Guangxi Science and Technology Plan Project for Research Bases and Talents of China grantid: AD23023001 – fundername: National Natural Science Foundation of China grantid: 11961006 funderid: http://dx.doi.org/10.13039/501100001809 – fundername: Guangxi Natural Science Foundation of China grantid: 2020GXNSFAA159100 |
| GroupedDBID | -52 -57 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29K 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2O M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCLPG SDD SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z81 Z83 Z86 Z88 Z8M Z8N Z8T Z8U Z8W Z92 ZMTXR ZWQNP ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT 7SC 7XB 8AL 8FD 8FK ABRTQ JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQGLB PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c270t-4f532118ecb5cc7106aa40e039d400d337b6bba5aa5899e66af6040a6a34e3bb3 |
| IEDL.DBID | U2A |
| ISSN | 0925-5001 |
| IngestDate | Sat Aug 16 21:23:08 EDT 2025 Tue Jul 01 00:53:02 EDT 2025 Fri Feb 21 02:39:56 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Strict feasibility S-tensor tuple Polynomial complementarity problem |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c270t-4f532118ecb5cc7106aa40e039d400d337b6bba5aa5899e66af6040a6a34e3bb3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9869-9291 |
| PQID | 3047006906 |
| PQPubID | 29930 |
| PageCount | 15 |
| ParticipantIDs | proquest_journals_3047006906 crossref_primary_10_1007_s10898_023_01339_z springer_journals_10_1007_s10898_023_01339_z |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20240500 2024-05-00 20240501 |
| PublicationDateYYYYMMDD | 2024-05-01 |
| PublicationDate_xml | – month: 5 year: 2024 text: 20240500 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationSubtitle | An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering |
| PublicationTitle | Journal of global optimization |
| PublicationTitleAbbrev | J Glob Optim |
| PublicationYear | 2024 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Hu, Wang, Huang (CR14) 2018; 179 Huang, Qi (CR12) 2019; 183 Hieu, Wei, Yao (CR16) 2020; 184 Gowda (CR9) 2017; 13 Palpandi, Sharma (CR22) 2021; 190 Song, Qi (CR25) 2017; 11 Lu, Du (CR20) 2023; 69 Ling, He, Ling (CR17) 2018; 67 Xu, Huang (CR35) 2021; 15 Wang, Hu, Huang (CR31) 2018; 176 Hieu (CR15) 2019; 181 Bai, Huang, Wang (CR1) 2016; 170 Wang, Huang, Xu (CR32) 2020; 14 Wang, Che, Wei (CR33) 2022; 82 Song, Qi (CR26) 2017; 33 Bai, Huang, Li (CR2) 2019; 36 Zhang, Sun, Luan (CR37) 2023; 66 Huang, Qi (CR11) 2017; 66 Song, Qi (CR23) 2015; 165 Huang, Li, Wang (CR13) 2023; 86 Wang, Wei, Wei (CR34) 2023; 197 Facchinei, Pang (CR8) 2003 Guo, Zheng, Huang (CR10) 2019; 67 Cottle, Pang, Stone (CR3) 1992 Cheng, Zhang (CR4) 2020; 75 Shang, Yang, Tang (CR28) 2022; 192 Zheng, Huang, Ma (CR36) 2020; 185 Cui, Fan, Song (CR5) 2022; 192 Li, Li (CR19) 2022; 16 Du, Che, Wei (CR6) 2020; 75 Shang, Tang (CR29) 2023; 86 Van Dinh, Pham (CR30) 2022; 192 Li, Shang, Tang (CR21) 2023 Liu, Huang (CR18) 2022; 30 Song, Mei (CR27) 2018; 176 Song, Yu (CR24) 2016; 170 Ferris, Pang (CR7) 1997; 39 MS Gowda (1339_CR9) 2017; 13 X Liu (1339_CR18) 2022; 30 XZ Wang (1339_CR33) 2022; 82 LY Ling (1339_CR17) 2018; 67 J Wang (1339_CR31) 2018; 176 YS Song (1339_CR26) 2017; 33 YS Song (1339_CR27) 2018; 176 Y Xu (1339_CR35) 2021; 15 K Palpandi (1339_CR22) 2021; 190 MD Lu (1339_CR20) 2023; 69 XZ Wang (1339_CR34) 2023; 197 VT Hieu (1339_CR15) 2019; 181 J Wang (1339_CR32) 2020; 14 F Facchinei (1339_CR8) 2003 ZH Huang (1339_CR11) 2017; 66 G Li (1339_CR19) 2022; 16 MM Zheng (1339_CR36) 2020; 185 Q Guo (1339_CR10) 2019; 67 XL Bai (1339_CR1) 2016; 170 LL Cheng (1339_CR4) 2020; 75 XL Bai (1339_CR2) 2019; 36 YS Song (1339_CR23) 2015; 165 TT Shang (1339_CR28) 2022; 192 B Van Dinh (1339_CR30) 2022; 192 LB Cui (1339_CR5) 2022; 192 ZH Huang (1339_CR12) 2019; 183 XL Li (1339_CR21) 2023 YS Song (1339_CR25) 2017; 11 VT Hieu (1339_CR16) 2020; 184 SL Hu (1339_CR14) 2018; 179 SQ Du (1339_CR6) 2020; 75 LP Zhang (1339_CR37) 2023; 66 RW Cottle (1339_CR3) 1992 YS Song (1339_CR24) 2016; 170 TT Shang (1339_CR29) 2023; 86 ZH Huang (1339_CR13) 2023; 86 MC Ferris (1339_CR7) 1997; 39 |
| References_xml | – volume: 170 start-page: 72 issue: 1 year: 2016 end-page: 84 ident: CR1 article-title: Global uniqueness and solvability for tensor complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-0903-4 – year: 2023 ident: CR21 article-title: Lower bounds of the solution set of the polynomial complementarity problem publication-title: Optim. Lett. doi: 10.1007/s11590-023-02004-w – volume: 36 start-page: 1940002 issue: 2 year: 2019 ident: CR2 article-title: Stability of solutions and continuity of solution maps of tensor complementarity problems publication-title: Asia Pac. J. Oper. Res. doi: 10.1142/S0217595919400025 – volume: 67 start-page: 685 issue: 4 year: 2019 end-page: 696 ident: CR10 article-title: Properties of S-tensor publication-title: Linear Multilinear Algebra doi: 10.1080/03081087.2018.1430737 – volume: 16 start-page: 2729 issue: 9 year: 2022 end-page: 2751 ident: CR19 article-title: QN-tensor and tensor complementarity problem publication-title: Optim. Lett. doi: 10.1007/s11590-022-01850-4 – volume: 197 start-page: 334 year: 2023 end-page: 357 ident: CR34 article-title: A fixed point iterative method for third-order tensor linear complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-023-02169-5 – volume: 179 start-page: 983 year: 2018 end-page: 1000 ident: CR14 article-title: Error bounds for the solution sets of quadratic complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-018-1356-8 – volume: 192 start-page: 443 year: 2022 end-page: 483 ident: CR28 article-title: Generalized polynomial complementarity problems over a polyhedral cone publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01969-x – volume: 192 start-page: 226 year: 2022 end-page: 247 ident: CR30 article-title: Error bounds of regularized gap functions for polynomial variational inequalities publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01960-6 – volume: 190 start-page: 951 year: 2021 end-page: 965 ident: CR22 article-title: Tensor complementarity problems with finite solution sets publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01917-9 – volume: 11 start-page: 1407 issue: 7 year: 2017 end-page: 1426 ident: CR25 article-title: Strictly semi-positive tensors and the boundedness of tensor complementarity problems publication-title: Optim. Lett. doi: 10.1007/s11590-016-1104-7 – volume: 15 start-page: 2701 year: 2021 end-page: 2718 ident: CR35 article-title: Bounds of the solution set of the tensor complementarity problem publication-title: Optim. Lett. doi: 10.1007/s11590-020-01697-7 – volume: 66 start-page: 557 year: 2017 end-page: 576 ident: CR11 article-title: Formulating an n-person noncooperative game as a tensor complementarity problem publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-016-9872-7 – volume: 170 start-page: 85 issue: 1 year: 2016 end-page: 96 ident: CR24 article-title: Properties of solution set of tensor complementarity problem publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-0907-0 – volume: 39 start-page: 669 issue: 4 year: 1997 end-page: 713 ident: CR7 article-title: Engineering and economic appliciations of complementarity problems publication-title: SIAM Rev. doi: 10.1137/S0036144595285963 – volume: 86 start-page: 953 issue: 4 year: 2023 end-page: 988 ident: CR29 article-title: Mixed polynomial variational inequalities publication-title: J. Global Optim. doi: 10.1007/s10898-023-01298-5 – volume: 192 start-page: 321 year: 2022 end-page: 334 ident: CR5 article-title: The existence and uniqueness of solution for tensor complementarity problem and related systems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01972-2 – volume: 82 start-page: 595 year: 2022 end-page: 615 ident: CR33 article-title: Randomized Kaczmarz methods for tensor complementarity problems publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-022-00382-y – year: 1992 ident: CR3 publication-title: The Linear Complementarity Problem – volume: 69 start-page: 2973 issue: 4 year: 2023 end-page: 2986 ident: CR20 article-title: A smoothing projected HS method for solving stochastic tensor complementarity problem publication-title: J. Appl. Math. Comput. doi: 10.1007/s12190-023-01868-6 – volume: 165 start-page: 854 issue: 3 year: 2015 end-page: 873 ident: CR23 article-title: Properties of some classes of structured tensors publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-014-0616-5 – volume: 67 start-page: 341 year: 2018 end-page: 358 ident: CR17 article-title: On error bounds of polynomial complementarity problems with structured tensors publication-title: Optimization doi: 10.1080/02331934.2017.1391254 – year: 2003 ident: CR8 publication-title: Finite-Dimensional Variational Inequalities and Complementarity Problems, Volumes I and II – volume: 30 start-page: 2196 issue: 6 year: 2022 end-page: 2204 ident: CR18 article-title: New error bounds for the tensor complementarity problem publication-title: Electron. Res. Arch. doi: 10.3934/era.2022111 – volume: 75 start-page: 649 year: 2020 end-page: 668 ident: CR6 article-title: Stochastic structured tensors to stochastic complementarity problems publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-019-00144-3 – volume: 33 start-page: 308 issue: 3 year: 2017 end-page: 323 ident: CR26 article-title: Properties of tensor complementarity problem and some classes of structured tensors publication-title: Ann. Appl. Math. – volume: 86 start-page: 495 year: 2023 end-page: 520 ident: CR13 article-title: A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors publication-title: J. Global Optim. doi: 10.1007/s10898-022-01263-8 – volume: 184 start-page: 687 year: 2020 end-page: 695 ident: CR16 article-title: Notes on the optimization problems corresponding to polynomial complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-019-01596-7 – volume: 13 start-page: 227 year: 2017 end-page: 241 ident: CR9 article-title: Polynomial complementarity problems publication-title: Pac. J. Optim. – volume: 66 start-page: 647 year: 2023 end-page: 664 ident: CR37 article-title: Solvability of monotone tensor complementarity problems publication-title: Sci. China Math. – volume: 183 start-page: 771 year: 2019 end-page: 791 ident: CR12 article-title: Tensor complementarity problems-part III: applications publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-019-01573-0 – volume: 181 start-page: 163 year: 2019 end-page: 183 ident: CR15 article-title: On the -tensors and the solution map of tensor complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-018-1441-z – volume: 75 start-page: 629 year: 2020 end-page: 647 ident: CR4 article-title: A semidefinite relaxation method for second-order cone polynomial complementarity problems publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-019-00162-1 – volume: 185 start-page: 80 year: 2020 end-page: 98 ident: CR36 article-title: Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-020-01645-6 – volume: 176 start-page: 120 year: 2018 end-page: 136 ident: CR31 article-title: Solution sets of quadratic complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-017-1205-1 – volume: 14 start-page: 1571 year: 2020 end-page: 1582 ident: CR32 article-title: Existence and uniqueness of solutions of the generalized polynomial variational inequality publication-title: Optim. Lett. doi: 10.1007/s11590-019-01461-6 – volume: 176 start-page: 289 issue: 2 year: 2018 end-page: 305 ident: CR27 article-title: Structural properties of tensor and complementarity problems publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-017-1212-2 – volume-title: The Linear Complementarity Problem year: 1992 ident: 1339_CR3 – volume: 16 start-page: 2729 issue: 9 year: 2022 ident: 1339_CR19 publication-title: Optim. Lett. doi: 10.1007/s11590-022-01850-4 – volume-title: Finite-Dimensional Variational Inequalities and Complementarity Problems, Volumes I and II year: 2003 ident: 1339_CR8 – volume: 179 start-page: 983 year: 2018 ident: 1339_CR14 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-018-1356-8 – volume: 36 start-page: 1940002 issue: 2 year: 2019 ident: 1339_CR2 publication-title: Asia Pac. J. Oper. Res. doi: 10.1142/S0217595919400025 – volume: 67 start-page: 685 issue: 4 year: 2019 ident: 1339_CR10 publication-title: Linear Multilinear Algebra doi: 10.1080/03081087.2018.1430737 – volume: 13 start-page: 227 year: 2017 ident: 1339_CR9 publication-title: Pac. J. Optim. – volume: 82 start-page: 595 year: 2022 ident: 1339_CR33 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-022-00382-y – volume: 176 start-page: 289 issue: 2 year: 2018 ident: 1339_CR27 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-017-1212-2 – volume: 33 start-page: 308 issue: 3 year: 2017 ident: 1339_CR26 publication-title: Ann. Appl. Math. – volume: 15 start-page: 2701 year: 2021 ident: 1339_CR35 publication-title: Optim. Lett. doi: 10.1007/s11590-020-01697-7 – volume: 184 start-page: 687 year: 2020 ident: 1339_CR16 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-019-01596-7 – volume: 66 start-page: 647 year: 2023 ident: 1339_CR37 publication-title: Sci. China Math. – volume: 75 start-page: 629 year: 2020 ident: 1339_CR4 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-019-00162-1 – volume: 86 start-page: 953 issue: 4 year: 2023 ident: 1339_CR29 publication-title: J. Global Optim. doi: 10.1007/s10898-023-01298-5 – volume: 86 start-page: 495 year: 2023 ident: 1339_CR13 publication-title: J. Global Optim. doi: 10.1007/s10898-022-01263-8 – volume: 67 start-page: 341 year: 2018 ident: 1339_CR17 publication-title: Optimization doi: 10.1080/02331934.2017.1391254 – year: 2023 ident: 1339_CR21 publication-title: Optim. Lett. doi: 10.1007/s11590-023-02004-w – volume: 69 start-page: 2973 issue: 4 year: 2023 ident: 1339_CR20 publication-title: J. Appl. Math. Comput. doi: 10.1007/s12190-023-01868-6 – volume: 66 start-page: 557 year: 2017 ident: 1339_CR11 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-016-9872-7 – volume: 170 start-page: 72 issue: 1 year: 2016 ident: 1339_CR1 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-0903-4 – volume: 39 start-page: 669 issue: 4 year: 1997 ident: 1339_CR7 publication-title: SIAM Rev. doi: 10.1137/S0036144595285963 – volume: 197 start-page: 334 year: 2023 ident: 1339_CR34 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-023-02169-5 – volume: 170 start-page: 85 issue: 1 year: 2016 ident: 1339_CR24 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-016-0907-0 – volume: 14 start-page: 1571 year: 2020 ident: 1339_CR32 publication-title: Optim. Lett. doi: 10.1007/s11590-019-01461-6 – volume: 192 start-page: 443 year: 2022 ident: 1339_CR28 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01969-x – volume: 192 start-page: 226 year: 2022 ident: 1339_CR30 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01960-6 – volume: 176 start-page: 120 year: 2018 ident: 1339_CR31 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-017-1205-1 – volume: 181 start-page: 163 year: 2019 ident: 1339_CR15 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-018-1441-z – volume: 11 start-page: 1407 issue: 7 year: 2017 ident: 1339_CR25 publication-title: Optim. Lett. doi: 10.1007/s11590-016-1104-7 – volume: 165 start-page: 854 issue: 3 year: 2015 ident: 1339_CR23 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-014-0616-5 – volume: 183 start-page: 771 year: 2019 ident: 1339_CR12 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-019-01573-0 – volume: 30 start-page: 2196 issue: 6 year: 2022 ident: 1339_CR18 publication-title: Electron. Res. Arch. doi: 10.3934/era.2022111 – volume: 185 start-page: 80 year: 2020 ident: 1339_CR36 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-020-01645-6 – volume: 75 start-page: 649 year: 2020 ident: 1339_CR6 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-019-00144-3 – volume: 190 start-page: 951 year: 2021 ident: 1339_CR22 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01917-9 – volume: 192 start-page: 321 year: 2022 ident: 1339_CR5 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-021-01972-2 |
| SSID | ssj0009852 |
| Score | 2.4059165 |
| Snippet | In the present paper, the strict feasibility of the polynomial complementarity problem (PCP) is investigated. To this end, as a generalization of the concept... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 57 |
| SubjectTerms | Applied mathematics Computer Science Euclidean space Feasibility Mathematical analysis Mathematical programming Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Real Functions Tensors |
| SummonAdditionalLinks | – databaseName: ProQuest Central dbid: BENPR link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1RS8MwED50e9EHcVNxOiUPPiga7JImbZ9EZWMIDhEHeytJloIg23T1Yfv1XtqUqqDPhTx817v7Lrm7D-CMRUwaJhSV1kY0xARMdWI55Zi8e8xqHcZuwPlxJIfj8GEiJv7CbenbKquYWATq6dy4O_Jr9zxUrtW9WbxTpxrlXle9hMYmNDEEx1h8Ne_6o6fneu1uXGjuBAkTVGBE9mMzfnguduNlzPUTcZ7Q9c_UVPPNX0-kReYZ7MKOp4zktrRxCzbsrA3b3xYJtqHlXXRJzv0e6Ys9cCrFryYnmVW-B3ZFkKISpHxkMX9buYFkPLdoKi97yJ2QHfESM_swHvRf7ofUqyVQw6Igp2EmOFZzsTVaGIPEQSoVBjbgyRT9dMp5pKXWSiglsMayUqpMogcrqXhoudb8ABqz-cweAgmySOs4U2i6aaiERBQjnaBJA9XTKjYduKyAShflUoy0Xn_sYE0R1rSANV13oFthmXoHWaa1OTtwVeFbf_77tKP_TzuGLYa0o2xJ7EIj__i0J0gbcn3q_40vl2a-fw priority: 102 providerName: ProQuest |
| Title | Strict feasibility for the polynomial complementarity problem |
| URI | https://link.springer.com/article/10.1007/s10898-023-01339-z https://www.proquest.com/docview/3047006906 |
| Volume | 89 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_c9qIP6qbidI48-KBooGuatH3cZB8oGyIO5lNJuhQE2YarD9tf76VN3RR98CmUpincR-6Ou_sdwKXruyJ2uaRCa596aICpCjWjDI13y9VKeYFpcB6OxGDs3U_4xDaFLYtq9yIlmd3UW81ugWkHc039D2MhXZegwk3sjlI8dtsbqN0gm7PjhC6nHG9h2yrz-xnfzdHGx_yRFs2sTe8Q9q2bSNo5X6uwo2c1OChGMBCrkTXY28ITxKfhFwjrsgZVu2tJriy49PURmNHFr3FKEi1tYeyKoN9K8DuymL-tTJcy_jirNM8Ly810O2LnzhzDuNd9vhtQO0KBxq7vpNRLOMMQL9Cx4nGM3oSQ0nO0w8IpKu-UMV8JpSSXkmPgpYWQiUC1lkIyTzOl2AmUZ_OZPgXiJL5SQSKRn1NPcoFk9lWIfHZkS8kgrsNNQclokSNlRBtMZEP3COkeZXSP1nVoFMSOrNYsI5MCzKGT63BbMGDz-u_Tzv63_Rx2UW68vG6xAeX0_UNfoG-RqiaUgl6_CZV2r9MZmbX_8tDFtdMdPT41M0H7BIcnyxQ |
| linkProvider | Springer Nature |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NS8NAEB20HtSD-InVqntQUHQx3c1ukoOIqLXa6knBW9xNNyBIW21F2h_lb3Q22RAV9NZzyBxe3s5HdmYewC4LmEyYUFQaE1AfAzDVkeGUY_CuM6O1H9oB59s72Xzwbx7F4xR8FrMwtq2y8ImZo-70EvuP_NheD-VrdU_7r9SqRtnb1UJCI6dFy4w-sGQbnFxf4PfdY6xxeX_epE5VgCYs8IbUTwXHqic0iRZJggFWKuV7xuNRB_nc4TzQUmsllBJYixgpVSqR6Uoq7huuNUe70zDjcx7ZExU2rsolv2Gm8ONFTFCB_t8N6bhRvdAOszHbvYSv0vHPQFhmt78uZLM411iEBZegkrOcUUswZbrLMP9tbeEyLDmHMCD7bmv1wQpYTeTnZEhSo1zH7YhgQkwwwST93svIjj-j3ayFPe9Yt7J5xAnarMLDRFBcg0q31zXrQLw00DpMFRKl4yshEcVAR0ggT9W1CpMqHBZAxf18BUdcLlu2sMYIa5zBGo-rUCuwjN1xHMQleapwVOBbPv7b2sb_1nZgtnl_247b13etTZhjmPDkzZA1qAzf3s0WJixDvZ2xhMDTpGn5BRJ_-dc |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NS8NAEB20BdGD-In1cw8Kii7G3ewmOYj4VazVUkTBW9xNNyBIW21F6k_z1zmbbIgKevMcmMPLy85M9s08gE0WMJkwoag0JqA-JmCqI8Mpx-R9wIzWfmgHnK9b8uLOv7wX92PwUczCWFllcSZmB3Wnl9h_5Pv2eihfq7ufOllE-6x-1H-m1kHK3rQWdho5RZpm9Ibt2-CwcYbveoux-vnt6QV1DgM0YYE3pH4qOHZAoUm0SBJMtlIp3zMejzrI7Q7ngZZaK6GUwL7ESKlSiaxXUnHfcK05xh2HaoBdkVeB6sl5q31TrvwNM78fL2KCCswGbmTHDe6FdrSNWS0T5xF9_54Wy1r3x_VslvXqMzDtylVynPNrFsZMdw6mviwxnINZdzwMyLbbYb0zD9Yh-TEZktQop78dESyPCZabpN97GtlhaIybCdpz_bo10SPO3mYB7v4Fx0WodHtdswTESwOtw1QhbTq-EhJRDHSEdPLUgVZhUoPdAqi4ny_kiMvVyxbWGGGNM1jj9xqsFljG7uMcxCWVarBX4Fs-_j3a8t_RNmACKRlfNVrNFZhkWP3kyshVqAxfXs0aVi9Dve5oQuDhv5n5CeYR_2k |
| 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=Strict+feasibility+for+the+polynomial+complementarity+problem&rft.jtitle=Journal+of+global+optimization&rft.au=Li%2C+Xue-liu&rft.au=Tang%2C+Guo-ji&rft.date=2024-05-01&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=89&rft.issue=1&rft.spage=57&rft.epage=71&rft_id=info:doi/10.1007%2Fs10898-023-01339-z&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10898_023_01339_z |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon |