A derivative-free filter method for solving nonlinear complementarity problems

In this work, nonlinear complementarity problems (NCPs) are considered. Some NCPs, which come from practice, have no derivatives or it is very difficult to obtain their derivatives. Derivative-free methods are hence considered. Generalized pattern search (GPS) method, as a kind of derivative-free me...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 161; číslo 3; s. 787 - 797
Hlavní autori: Nie, Pu-yan, Fan, Jin-yan
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY Elsevier Inc 2005
Elsevier
Predmet:
ISSN:0096-3003, 1873-5649
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this work, nonlinear complementarity problems (NCPs) are considered. Some NCPs, which come from practice, have no derivatives or it is very difficult to obtain their derivatives. Derivative-free methods are hence considered. Generalized pattern search (GPS) method, as a kind of derivative-free method, plays a very significant role. We combine generalized pattern search method with filter method to attack NCPs because one can analyze the theory of generalized pattern search filter method without sufficient reduction conditions and avoid using of derivatives. Some interesting results are obtained in this work without sufficient reduction conditions. Furthermore, generalized pattern search filter method is efficient to some special problems.
AbstractList In this work, nonlinear complementarity problems (NCPs) are considered. Some NCPs, which come from practice, have no derivatives or it is very difficult to obtain their derivatives. Derivative-free methods are hence considered. Generalized pattern search (GPS) method, as a kind of derivative-free method, plays a very significant role. We combine generalized pattern search method with filter method to attack NCPs because one can analyze the theory of generalized pattern search filter method without sufficient reduction conditions and avoid using of derivatives. Some interesting results are obtained in this work without sufficient reduction conditions. Furthermore, generalized pattern search filter method is efficient to some special problems.
Author Fan, Jin-yan
Nie, Pu-yan
Author_xml – sequence: 1
  givenname: Pu-yan
  surname: Nie
  fullname: Nie, Pu-yan
  email: conver001@yahoo.com.cn
  organization: Department of Mathematics, College of Information Science and Technology, Jinan University, Guangzhou 510632, PR China
– sequence: 2
  givenname: Jin-yan
  surname: Fan
  fullname: Fan, Jin-yan
  organization: Department of Mathematics, Shanghai Jiaotong University, Shanghai 200240, PR China
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16443633$$DView record in Pascal Francis
BookMark eNp9kEtrwzAQhEVJoUnaH9CbLz3alSz5IXoKoS8I7aU9C1latQq2ZSRhyL-vQkoPPeS0LDvfLDMrtBjdCAjdElwQTOr7fSEHVZQY04KUBabtBVqStqF5VTO-QEuMeZ3TdL5CqxD2GOOmJmyJ3jaZBm9nGe0MufEAmbF9BJ8NEL-dzozzWXD9bMevLP3s7QjSZ8oNUw8DjFF6Gw_Z5F2X9nCNLo3sA9z8zjX6fHr82L7ku_fn1-1mlytaNjHnBFeKMwmEUYNNLbu2ZFp3XWmYUhXWmjZaE8J5TaDhWFVctxWYrgToSgJ0je5OvpMMSvbGy1HZICZvB-kPgtSM0ZrSpGtOOuVdCB6MUDamrG6MXtpeECyO9Ym9SPWJY32ClCLVl0jyj_wzP8M8nBhI0WcLXgRlYVSgrQcVhXb2DP0DAJOLsw
CODEN AMHCBQ
CitedBy_id crossref_primary_10_1007_s40314_023_02465_w
crossref_primary_10_1016_j_amc_2010_01_063
crossref_primary_10_1016_j_amc_2005_02_022
crossref_primary_10_1016_j_cam_2011_02_034
crossref_primary_10_1155_2013_450829
crossref_primary_10_1016_j_nonrwa_2008_02_010
crossref_primary_10_1049_cth2_12450
crossref_primary_10_1016_j_amc_2006_11_103
crossref_primary_10_1016_j_camwa_2007_08_037
crossref_primary_10_1007_s10898_014_0157_3
crossref_primary_10_1016_j_amc_2006_04_048
crossref_primary_10_1016_j_amc_2008_08_039
Cites_doi 10.1016/S0096-3003(03)00135-8
10.1007/BF01586928
10.1080/10556789408805573
10.1137/S1052623493250780
10.1007/s002110050133
10.1007/BF00249054
10.1007/BF02614396
10.1007/s101070100244
10.1137/S105262340038081X
ContentType Journal Article
Copyright 2003 Elsevier Inc.
2005 INIST-CNRS
Copyright_xml – notice: 2003 Elsevier Inc.
– notice: 2005 INIST-CNRS
DBID AAYXX
CITATION
IQODW
DOI 10.1016/j.amc.2003.12.038
DatabaseName CrossRef
Pascal-Francis
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Applied Sciences
EISSN 1873-5649
EndPage 797
ExternalDocumentID 16443633
10_1016_j_amc_2003_12_038
S009630030400030X
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
ABAOU
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACRLP
ADBBV
ADEZE
ADGUI
ADIYS
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AI.
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SES
SEW
SME
SPC
SPCBC
SSW
SSZ
T5K
TAE
TN5
VH1
VOH
WH7
WUQ
X6Y
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
ID FETCH-LOGICAL-c327t-9105c94ae143f0f6ab824ddbb2f4cc50dd37dd119961e790c59d85efb2eeb21e3
ISICitedReferencesCount 15
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000226859800009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0096-3003
IngestDate Mon Jul 21 09:16:56 EDT 2025
Sat Nov 29 02:46:04 EST 2025
Tue Nov 18 21:00:26 EST 2025
Fri Feb 23 02:29:05 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Filter methods
Global convergence
Nonlinear complementarity problem
Nonlinear programming
Generalized pattern search methods
Reduction method
Sufficient condition
Applied mathematics
Complementarity problem
Nonlinear problems
Non linear programming
Pattern recognition
Convergence
Filter method
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c327t-9105c94ae143f0f6ab824ddbb2f4cc50dd37dd119961e790c59d85efb2eeb21e3
PageCount 11
ParticipantIDs pascalfrancis_primary_16443633
crossref_citationtrail_10_1016_j_amc_2003_12_038
crossref_primary_10_1016_j_amc_2003_12_038
elsevier_sciencedirect_doi_10_1016_j_amc_2003_12_038
PublicationCentury 2000
PublicationDate 2005-00-00
PublicationDateYYYYMMDD 2005-01-01
PublicationDate_xml – year: 2005
  text: 2005-00-00
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle Applied mathematics and computation
PublicationYear 2005
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Torczon (BIB12) 1997; 7
Fischer (BIB3) 1997; 76
Fletcher, Leyffer (BIB4) 2002; 91
Kanzow (BIB7) 1994; 3
Cottle, Pang, Stone (BIB2) 1992
Pang (BIB10) 1991; 51
Fletcher, Leyffer, Toint (BIB5) 2002; 13
Nie (BIB8) 2003; 21
C. Audet, J.E. Dennis, Jr., Combining patter search and filter algorithms for derivative free optimization, TR00-9 Department of Computational and Applied Mathematics, Rice University, Houston, TX, 2000
Yuan (BIB11) 1995; 70
Geiger, Kanzow (BIB6) 1996; 5
Nie (BIB9) 2004; 149
Fletcher (10.1016/j.amc.2003.12.038_BIB4) 2002; 91
Yuan (10.1016/j.amc.2003.12.038_BIB11) 1995; 70
Nie (10.1016/j.amc.2003.12.038_BIB9) 2004; 149
Fischer (10.1016/j.amc.2003.12.038_BIB3) 1997; 76
Torczon (10.1016/j.amc.2003.12.038_BIB12) 1997; 7
Geiger (10.1016/j.amc.2003.12.038_BIB6) 1996; 5
Fletcher (10.1016/j.amc.2003.12.038_BIB5) 2002; 13
Pang (10.1016/j.amc.2003.12.038_BIB10) 1991; 51
Cottle (10.1016/j.amc.2003.12.038_BIB2) 1992
Nie (10.1016/j.amc.2003.12.038_BIB8) 2003; 21
10.1016/j.amc.2003.12.038_BIB1
Kanzow (10.1016/j.amc.2003.12.038_BIB7) 1994; 3
References_xml – volume: 51
  start-page: 101
  year: 1991
  end-page: 131
  ident: BIB10
  article-title: A B-differentiable equations based, globally and locally quadratically convergent algorithm for nonlinear programming, complementarity, and variational inequality problems
  publication-title: Mathematical Programming
– volume: 7
  start-page: 1
  year: 1997
  end-page: 25
  ident: BIB12
  article-title: On the convergence of pattern search algorithms
  publication-title: SIAM Journal on Optimization
– year: 1992
  ident: BIB2
  article-title: The Linear Complementarity Problem
– volume: 76
  start-page: 513
  year: 1997
  end-page: 532
  ident: BIB3
  article-title: Solution of monotone complementarity problems with locally Lipschitzian functions
  publication-title: Mathematical Programming
– volume: 13
  start-page: 44
  year: 2002
  end-page: 59
  ident: BIB5
  article-title: On the global convergence of a SQP-filter algorithm
  publication-title: SIAM Journal on Optimization
– volume: 21
  start-page: 613
  year: 2003
  end-page: 624
  ident: BIB8
  article-title: Composite-step like filter methods for equality constraint problems
  publication-title: Journal of Computational Mathematics
– reference: C. Audet, J.E. Dennis, Jr., Combining patter search and filter algorithms for derivative free optimization, TR00-9 Department of Computational and Applied Mathematics, Rice University, Houston, TX, 2000
– volume: 149
  start-page: 215
  year: 2004
  end-page: 226
  ident: BIB9
  article-title: A null space method for system of nonlinear equations
  publication-title: Applied Mathematics and Computation
– volume: 91
  start-page: 239
  year: 2002
  end-page: 269
  ident: BIB4
  article-title: Nonlinear programming without a penalty function
  publication-title: Mathematical Programming
– volume: 5
  start-page: 155
  year: 1996
  end-page: 173
  ident: BIB6
  article-title: On the solution of monotone complementarity problems
  publication-title: Computational Optimization and Application
– volume: 3
  start-page: 327
  year: 1994
  end-page: 340
  ident: BIB7
  article-title: Some equation-based methods for the nonlinear complementarity problem
  publication-title: Optimization Methods Software
– volume: 70
  start-page: 515
  year: 1995
  end-page: 539
  ident: BIB11
  article-title: On the convergence of a new trust region algorithm
  publication-title: Numerische Mathematik
– volume: 149
  start-page: 215
  year: 2004
  ident: 10.1016/j.amc.2003.12.038_BIB9
  article-title: A null space method for system of nonlinear equations
  publication-title: Applied Mathematics and Computation
  doi: 10.1016/S0096-3003(03)00135-8
– volume: 51
  start-page: 101
  year: 1991
  ident: 10.1016/j.amc.2003.12.038_BIB10
  article-title: A B-differentiable equations based, globally and locally quadratically convergent algorithm for nonlinear programming, complementarity, and variational inequality problems
  publication-title: Mathematical Programming
  doi: 10.1007/BF01586928
– volume: 3
  start-page: 327
  year: 1994
  ident: 10.1016/j.amc.2003.12.038_BIB7
  article-title: Some equation-based methods for the nonlinear complementarity problem
  publication-title: Optimization Methods Software
  doi: 10.1080/10556789408805573
– volume: 7
  start-page: 1
  year: 1997
  ident: 10.1016/j.amc.2003.12.038_BIB12
  article-title: On the convergence of pattern search algorithms
  publication-title: SIAM Journal on Optimization
  doi: 10.1137/S1052623493250780
– year: 1992
  ident: 10.1016/j.amc.2003.12.038_BIB2
– volume: 70
  start-page: 515
  year: 1995
  ident: 10.1016/j.amc.2003.12.038_BIB11
  article-title: On the convergence of a new trust region algorithm
  publication-title: Numerische Mathematik
  doi: 10.1007/s002110050133
– ident: 10.1016/j.amc.2003.12.038_BIB1
– volume: 5
  start-page: 155
  year: 1996
  ident: 10.1016/j.amc.2003.12.038_BIB6
  article-title: On the solution of monotone complementarity problems
  publication-title: Computational Optimization and Application
  doi: 10.1007/BF00249054
– volume: 76
  start-page: 513
  year: 1997
  ident: 10.1016/j.amc.2003.12.038_BIB3
  article-title: Solution of monotone complementarity problems with locally Lipschitzian functions
  publication-title: Mathematical Programming
  doi: 10.1007/BF02614396
– volume: 91
  start-page: 239
  year: 2002
  ident: 10.1016/j.amc.2003.12.038_BIB4
  article-title: Nonlinear programming without a penalty function
  publication-title: Mathematical Programming
  doi: 10.1007/s101070100244
– volume: 13
  start-page: 44
  year: 2002
  ident: 10.1016/j.amc.2003.12.038_BIB5
  article-title: On the global convergence of a SQP-filter algorithm
  publication-title: SIAM Journal on Optimization
  doi: 10.1137/S105262340038081X
– volume: 21
  start-page: 613
  year: 2003
  ident: 10.1016/j.amc.2003.12.038_BIB8
  article-title: Composite-step like filter methods for equality constraint problems
  publication-title: Journal of Computational Mathematics
SSID ssj0007614
Score 1.8161668
Snippet In this work, nonlinear complementarity problems (NCPs) are considered. Some NCPs, which come from practice, have no derivatives or it is very difficult to...
SourceID pascalfrancis
crossref
elsevier
SourceType Index Database
Enrichment Source
Publisher
StartPage 787
SubjectTerms Applied sciences
Artificial intelligence
Calculus of variations and optimal control
Computer science; control theory; systems
Exact sciences and technology
Filter methods
Generalized pattern search methods
Global convergence
Mathematical analysis
Mathematical programming
Mathematics
Nonlinear complementarity problem
Nonlinear programming
Operational research and scientific management
Operational research. Management science
Pattern recognition. Digital image processing. Computational geometry
Sciences and techniques of general use
Title A derivative-free filter method for solving nonlinear complementarity problems
URI https://dx.doi.org/10.1016/j.amc.2003.12.038
Volume 161
WOSCitedRecordID wos000226859800009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-5649
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007614
  issn: 0096-3003
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbTQ8NpfRJk7ZBh54aXGzJXsnHpSQkoV0CTWFvRk9ISMyyL5J_n9HL-ygJzaEXYYQtyZ7PmtFo9A1CX1VhSwV2bUYFlbBAsSQT1MjMKUNb5GpAlGfX_8lGIz4e1-e93u90FmZ5zdqW397Wk_8qaqgDYbujs08Qd9coVMA1CB1KEDuU_yT44aGGbpae0DuzU2Mc95KjQgzJon1cIYzAOxLaQJQhpiG0PESSu3R2hzHRzGzdeE0W601H9TpLx-Imi80t_VHY9jhfZHcr-B0HZ-vZZdvVJn9DtT571i5OLqcbs2fgUo8woWtzIYuaNKhVFsJw_5qxg_Pg6ru48YSS1DtnA-HLJjv2ltbqYglTmNpVA024rJq0KUgDTTxDO4RVNe-jneHp0fisU9BsECjf0-ukzW4f9rc1jofMlZcTMYOfyIbsJ2smycVr9CquJfAwYOAN6pn2Ldr9tZLOOzQa4i004IAGHNCAAQ04ogF3aMBbaMAJDe_Rn-Ojix8nWUyhkSlK2BxUWV6puhQGzGKb24GQnJRaS0ngF1VVrjVlWhcuFL0wrM5VVWteGSuJMZIUhn5AfejcfES4sJJrQrQtZFnaXHFRGl5pI60g3FK5h_L0pRoV-eVdmpPr5kEJ7aFv3SOTQK7y2M1l-vxNtA6D1dcAlB577GBDVKuOYCVAB5TuP2UQn9ALz93rfXCfUX8-XZgv6Llazi9n04MItHsaj5Q5
linkProvider Elsevier
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=A+derivative-free+filter+method+for+solving+nonlinear+complementarity+problems&rft.jtitle=Applied+mathematics+and+computation&rft.au=Nie%2C+Pu-yan&rft.au=Fan%2C+Jin-yan&rft.date=2005&rft.issn=0096-3003&rft.volume=161&rft.issue=3&rft.spage=787&rft.epage=797&rft_id=info:doi/10.1016%2Fj.amc.2003.12.038&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2003_12_038
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon