A non-monotone line search multidimensional filter-SQP method for general nonlinear programming

In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with...

Full description

Saved in:
Bibliographic Details
Published in:Numerical algorithms Vol. 56; no. 4; pp. 537 - 559
Main Authors: Gu, Chao, Zhu, Detong
Format: Journal Article
Language:English
Published: Boston Springer US 01.04.2011
Springer Nature B.V
Subjects:
ISSN:1017-1398, 1572-9265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with the non-monotone technique and second order correction step, it is shown that the proposed method does not suffer from the Maratos effect, so that fast local convergence to second order sufficient local solutions is achieved. Numerical results show that the new approach is efficient.
AbstractList In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with the non-monotone technique and second order correction step, it is shown that the proposed method does not suffer from the Maratos effect, so that fast local convergence to second order sufficient local solutions is achieved. Numerical results show that the new approach is efficient.
In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wachter--Biegler methods for nonlinear equality constrained programming. Under mild conditions, the global convergence of the new method is proved. Furthermore, with the non-monotone technique and second order correction step, it is shown that the proposed method does not suffer from the Maratos effect, so that fast local convergence to second order sufficient local solutions is achieved. Numerical results show that the new approach is efficient.
Author Gu, Chao
Zhu, Detong
Author_xml – sequence: 1
  givenname: Chao
  surname: Gu
  fullname: Gu, Chao
  email: chaogumath@gmail.com
  organization: School of Math. and Info., Shanghai LiXin University of Commerce
– sequence: 2
  givenname: Detong
  surname: Zhu
  fullname: Zhu, Detong
  organization: Business College, Shanghai Normal University
BookMark eNp9kE1LwzAch4NMcJt-AG8FL16i_6Tt0hzH8A0GKuo5JG26ZbTJTLKD-_RmVBAGesgL5Hl-SX4TNLLOaoQuCdwQAHYbCAFWYiCAeQE53p-gMSkZxZzOylHaA2GY5Lw6Q5MQNpBAoGyMxDxLSbh31sWUmHUmTUFLX6-zftdF05he22CclV3Wmi5qj99eX7Jex7Vrstb5bKWt9uk05Rxs6bOtdysv-97Y1Tk6bWUX9MXPOkUf93fvi0e8fH54WsyXuM4LHnFdlgqkYkqTpqiAqplKg6uirdtG03bGNVNUNsBpQ8uKqZZA3aiiUMAkVZBP0fWQm-7-3OkQRW9CrbtOWu12QRDGIM_zivCEXh2hG7fz6X9BUE6qGT10lSg2ULV3IXjditpEGVMR0UvTCQLiULwYihepT3EoXuyTSY7MrTe99F__OnRwQmLtSvvfN_0tfQOEnJmG
CitedBy_id crossref_primary_10_1007_s11424_014_2024_1
crossref_primary_10_1016_j_amc_2015_04_001
crossref_primary_10_1016_j_engappai_2022_105024
crossref_primary_10_1016_j_amc_2013_05_011
crossref_primary_10_1080_01630563_2015_1133643
crossref_primary_10_1155_2014_293475
crossref_primary_10_1080_0305215X_2016_1176828
crossref_primary_10_1007_s10114_016_4513_8
crossref_primary_10_1016_j_apm_2011_11_014
crossref_primary_10_1016_j_amc_2012_04_007
crossref_primary_10_1016_j_jmaa_2013_06_052
crossref_primary_10_1016_j_amc_2014_10_015
crossref_primary_10_1002_cjce_22395
crossref_primary_10_1016_j_amc_2014_04_101
crossref_primary_10_1080_0305215X_2013_765002
Cites_doi 10.1007/b98874
10.1007/s101070100263
10.1016/j.camwa.2008.05.030
10.1137/040603851
10.1007/s10496-008-0055-y
10.1137/S1052623403422637
10.1137/S0036144504446096
10.1137/S105262340038081X
10.1007/s12190-008-0089-5
10.1007/s101070100244
10.1137/0728063
10.1137/S1052623499357258
10.1016/j.apnum.2008.01.005
10.1007/s10107-002-0343-9
10.1137/0723046
10.1137/S1052623403426544
10.1090/conm/163/01559
10.1007/978-3-642-48320-2
ContentType Journal Article
Copyright Springer Science+Business Media, LLC. 2010
Springer Science+Business Media, LLC. 2010.
Copyright_xml – notice: Springer Science+Business Media, LLC. 2010
– notice: Springer Science+Business Media, LLC. 2010.
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
M7S
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
7SC
7TB
8FD
FR3
KR7
L7M
L~C
L~D
DOI 10.1007/s11075-010-9403-z
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Database (Proquest)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central (subscription)
Technology collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Engineering Collection
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer Science Database
Civil Engineering Abstracts
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Mathematics
Computer Science
EISSN 1572-9265
EndPage 559
ExternalDocumentID 10_1007_s11075_010_9403_z
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
123
1N0
1SB
2.D
203
29N
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5QI
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
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
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
KOW
LAK
LLZTM
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
PTHSS
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VOH
W23
W48
WK8
YLTOR
Z45
Z7R
Z7X
Z7Z
Z81
Z83
Z88
Z8M
Z8R
Z8T
Z8W
Z92
ZMTXR
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
L6V
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
7SC
7TB
8FD
FR3
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-c349t-c55b0ab7be1d4802b6b2b69b4fcfde2f69e7b2ad092d2587bf10cdb44b07a2b03
IEDL.DBID M7S
ISICitedReferencesCount 17
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000288021900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1017-1398
IngestDate Sun Nov 09 11:22:16 EST 2025
Wed Nov 05 06:47:11 EST 2025
Sat Nov 29 01:34:37 EST 2025
Tue Nov 18 20:53:10 EST 2025
Fri Feb 21 02:32:23 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Line search
General nonlinear programming
65K05
90C30
90C55
Multidimensional filter
Maratos effect
49M37
Non-monotone
Convergence
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c349t-c55b0ab7be1d4802b6b2b69b4fcfde2f69e7b2ad092d2587bf10cdb44b07a2b03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 2918621017
PQPubID 2043837
PageCount 23
ParticipantIDs proquest_miscellaneous_1770333819
proquest_journals_2918621017
crossref_citationtrail_10_1007_s11075_010_9403_z
crossref_primary_10_1007_s11075_010_9403_z
springer_journals_10_1007_s11075_010_9403_z
PublicationCentury 2000
PublicationDate 20110400
2011-4-00
20110401
PublicationDateYYYYMMDD 2011-04-01
PublicationDate_xml – month: 4
  year: 2011
  text: 20110400
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
– name: New York
PublicationTitle Numerical algorithms
PublicationTitleAbbrev Numer Algor
PublicationYear 2011
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Gould, Leyffer, Toint (CR7) 2005; 15
Shen, Xue, Pu (CR17) 2009; 59
Gu, Zhu (CR12) 2009; 29
Wächter, Biegler (CR19) 2005; 16
Nocedal, Wright (CR14) 1999
Su, Yu (CR15) 2009; 57
Panier, Tits (CR16) 1991; 28
Fletcher, Leyffer, Toint (CR4) 2002; 13
Yang, Sun, Dang (CR21) 2008; 24
Yuan, Shi (CR22) 1994
Fletcher, Gould, Leyffer, Toint, Wächter (CR5) 2002; 13
Ulbrich, Ulbrich (CR18) 2003; 95
CR13
CR23
Fletcher, Leyffer (CR3) 2002; 91
CR11
CR10
Gould, Sainvitu, Toint (CR8) 2005; 16
Gill, Murray, Saunders (CR6) 2005; 47
Grippo, Lampariello, Ludidi (CR9) 1986; 23
Dolan, Moré (CR2) 2002; 91
Conn, Gould, Toint (CR1) 2000
Wächter, Biegler (CR20) 2005; 16
A Wächter (9403_CR20) 2005; 16
R Fletcher (9403_CR5) 2002; 13
Z Yang (9403_CR21) 2008; 24
ED Dolan (9403_CR2) 2002; 91
R Fletcher (9403_CR4) 2002; 13
PhE Gill (9403_CR6) 2005; 47
ER Panier (9403_CR16) 1991; 28
9403_CR10
R Fletcher (9403_CR3) 2002; 91
K Su (9403_CR15) 2009; 57
M Ulbrich (9403_CR18) 2003; 95
NIM Gould (9403_CR8) 2005; 16
C Shen (9403_CR17) 2009; 59
Y Yuan (9403_CR22) 1994
9403_CR13
9403_CR11
A Wächter (9403_CR19) 2005; 16
9403_CR23
J Nocedal (9403_CR14) 1999
AR Conn (9403_CR1) 2000
C Gu (9403_CR12) 2009; 29
NIM Gould (9403_CR7) 2005; 15
L Grippo (9403_CR9) 1986; 23
References_xml – year: 1999
  ident: CR14
  publication-title: Numerical Optimization
  doi: 10.1007/b98874
– volume: 91
  start-page: 201
  year: 2002
  end-page: 213
  ident: CR2
  article-title: Benchmarking optimization software with performance profiles
  publication-title: Math. Program.
  doi: 10.1007/s101070100263
– year: 2000
  ident: CR1
  article-title: Trust region methods
  publication-title: MPS/SIAM Ser. Optim., vol. 1
– volume: 57
  start-page: 240
  year: 2009
  end-page: 247
  ident: CR15
  article-title: A modified SQP method with nonmonotone technique and its global convergence
  publication-title: Comput. Math. Appl.
  doi: 10.1016/j.camwa.2008.05.030
– volume: 16
  start-page: 1
  year: 2005
  end-page: 31
  ident: CR19
  article-title: Line search filter methods for nonlinear programming: motivation and global convergence
  publication-title: SIAM J. Comput.
– volume: 16
  start-page: 341
  year: 2005
  end-page: 357
  ident: CR8
  article-title: A filter trust region method for unconstrained optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/040603851
– volume: 24
  start-page: 55
  year: 2008
  end-page: 66
  ident: CR21
  article-title: A filter-trust-region method for LC unconstrained optimization and its global convergence
  publication-title: Anal. Theory Appl.
  doi: 10.1007/s10496-008-0055-y
– volume: 15
  start-page: 17
  year: 2005
  end-page: 38
  ident: CR7
  article-title: A multidimensional filter algorithm for nonliear equations and nonlinear least squares
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403422637
– volume: 47
  start-page: 99
  year: 2005
  end-page: 131
  ident: CR6
  article-title: SNOPT: an SQP algorithm for large-scale constrained optimization
  publication-title: SIAM Rev.
  doi: 10.1137/S0036144504446096
– ident: CR13
– volume: 13
  start-page: 44
  year: 2002
  end-page: 59
  ident: CR4
  article-title: On the global convergence of a filter-SQP algorithm
  publication-title: SIAM J. Optim.
  doi: 10.1137/S105262340038081X
– ident: CR10
– ident: CR11
– start-page: 205
  year: 1994
  end-page: 225
  ident: CR22
  article-title: Trust region algorithms for nonlinear programming
  publication-title: Computational Mathematics in China
– volume: 29
  start-page: 67
  year: 2009
  end-page: 80
  ident: CR12
  article-title: A filter interior-point algorithm with projected Hessian updating for nonlinear optimization
  publication-title: J. Appl. Math. Comput.
  doi: 10.1007/s12190-008-0089-5
– volume: 91
  start-page: 239
  year: 2002
  end-page: 269
  ident: CR3
  article-title: Nonlinear programming without a penalty function
  publication-title: Math. Program.
  doi: 10.1007/s101070100244
– volume: 28
  start-page: 1183
  year: 1991
  end-page: 1195
  ident: CR16
  article-title: Avoiding the Maratos effect by means of a nonmonotone line search I: general constrained problems
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0728063
– volume: 13
  start-page: 635
  year: 2002
  end-page: 659
  ident: CR5
  article-title: Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623499357258
– volume: 59
  start-page: 235
  year: 2009
  end-page: 250
  ident: CR17
  article-title: Global convergence of a tri-dimensional filter SQP algorithm based on the line search method
  publication-title: Appl. Numer. Math.
  doi: 10.1016/j.apnum.2008.01.005
– volume: 95
  start-page: 103
  year: 2003
  end-page: 135
  ident: CR18
  article-title: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
  publication-title: Math. Program.
  doi: 10.1007/s10107-002-0343-9
– volume: 23
  start-page: 707
  year: 1986
  end-page: 716
  ident: CR9
  article-title: A nonmonotone line search technique for Newton’s method
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0723046
– volume: 16
  start-page: 32
  year: 2005
  end-page: 48
  ident: CR20
  article-title: Line search filter methods for nonlinear programming: local convergence
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403426544
– ident: CR23
– ident: 9403_CR23
– volume-title: Numerical Optimization
  year: 1999
  ident: 9403_CR14
  doi: 10.1007/b98874
– volume: 91
  start-page: 239
  year: 2002
  ident: 9403_CR3
  publication-title: Math. Program.
  doi: 10.1007/s101070100244
– volume: 47
  start-page: 99
  year: 2005
  ident: 9403_CR6
  publication-title: SIAM Rev.
  doi: 10.1137/S0036144504446096
– volume: 16
  start-page: 1
  year: 2005
  ident: 9403_CR19
  publication-title: SIAM J. Comput.
– volume: 28
  start-page: 1183
  year: 1991
  ident: 9403_CR16
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0728063
– volume: 16
  start-page: 341
  year: 2005
  ident: 9403_CR8
  publication-title: SIAM J. Optim.
  doi: 10.1137/040603851
– volume: 16
  start-page: 32
  year: 2005
  ident: 9403_CR20
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403426544
– volume: 23
  start-page: 707
  year: 1986
  ident: 9403_CR9
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0723046
– volume: 57
  start-page: 240
  year: 2009
  ident: 9403_CR15
  publication-title: Comput. Math. Appl.
  doi: 10.1016/j.camwa.2008.05.030
– ident: 9403_CR10
– ident: 9403_CR11
– volume: 13
  start-page: 635
  year: 2002
  ident: 9403_CR5
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623499357258
– volume: 29
  start-page: 67
  year: 2009
  ident: 9403_CR12
  publication-title: J. Appl. Math. Comput.
  doi: 10.1007/s12190-008-0089-5
– volume: 15
  start-page: 17
  year: 2005
  ident: 9403_CR7
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403422637
– volume: 95
  start-page: 103
  year: 2003
  ident: 9403_CR18
  publication-title: Math. Program.
  doi: 10.1007/s10107-002-0343-9
– volume-title: MPS/SIAM Ser. Optim., vol. 1
  year: 2000
  ident: 9403_CR1
– volume: 91
  start-page: 201
  year: 2002
  ident: 9403_CR2
  publication-title: Math. Program.
  doi: 10.1007/s101070100263
– volume: 59
  start-page: 235
  year: 2009
  ident: 9403_CR17
  publication-title: Appl. Numer. Math.
  doi: 10.1016/j.apnum.2008.01.005
– start-page: 205
  volume-title: Computational Mathematics in China
  year: 1994
  ident: 9403_CR22
  doi: 10.1090/conm/163/01559
– volume: 24
  start-page: 55
  year: 2008
  ident: 9403_CR21
  publication-title: Anal. Theory Appl.
  doi: 10.1007/s10496-008-0055-y
– volume: 13
  start-page: 44
  year: 2002
  ident: 9403_CR4
  publication-title: SIAM J. Optim.
  doi: 10.1137/S105262340038081X
– ident: 9403_CR13
  doi: 10.1007/978-3-642-48320-2
SSID ssj0010027
Score 1.9779074
Snippet In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wächter–Biegler methods...
In this paper, we propose a non-monotone line search multidimensional filter-SQP method for general nonlinear programming based on the Wachter--Biegler methods...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 537
SubjectTerms Algebra
Algorithms
Computer Science
Constraints
Convergence
Mathematical models
Nonlinear programming
Nonlinearity
Numeric Computing
Numerical Analysis
Original Paper
Programming
Searching
Theory of Computation
SummonAdditionalLinks – databaseName: SpringerLINK
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB58HfTgY1VcX0TwpATSbvrIUUTxoqyuirfQSVJZ0F3Zrh789U762EVRQQ-9pEnaZh6Z6UzmAzhMowhz8ku4kank0siYo81IrpxRibJKIGIJNpFcXaUPD6pbn-Mummz3JiRZaurpYTfyVHyimeBKig5_n4V52u1Sj9dw07ufhA68o1WGOEn9knmTNqHM76b4vBlNLcwvQdFyrzlf-ddbrsJybVqyk4oX1mDGDVqwUpuZrBbigpoaJIemrQVLl5PqrcU66BM2GA44MejQl-pm3hJllUiwMgHRekiAqpwHy_s-3s57111WoVEzMoPZY1XN2s_jR2cjVieCPdPHbMDd-dnt6QWvgRi46Ug15oYIKjJM0AVWpiLEGOlSKHOTWxfmsXIJhpkVKrRhlCaYB8JYlBJFkoUoOpswR89zW8CilEwgDF0ckWuphFUqxyA20qAllZ2ZNoiGItrUVco9WMaTntZX9iusaYW1X2H93oajyZCXqkTHb513GzLrWloLHaqAHDvPMW04mNwmOfPBk2zghq-FDhLSjR3v37bhuCH9dIofH7j9p947sFj9tPapQbswNx69uj1YMG_jfjHaLxn9Azf9-hg
  priority: 102
  providerName: Springer Nature
Title A non-monotone line search multidimensional filter-SQP method for general nonlinear programming
URI https://link.springer.com/article/10.1007/s11075-010-9403-z
https://www.proquest.com/docview/2918621017
https://www.proquest.com/docview/1770333819
Volume 56
WOSCitedRecordID wos000288021900004&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: PRVAVX
  databaseName: SpringerLINK
  customDbUrl:
  eissn: 1572-9265
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0010027
  issn: 1017-1398
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB71wYEeaCmgLpSVkTiBLJys8_AJFdQKqepq6QLqzcrYTlWJ7rabLYf-emYSZ1cg0QuH5JLYTjSPfOOZfAPwtswyrCkukU6XWmqnc4m-IrsKzhTGG4WIbbOJYjwuLy7MJG64NbGssveJraP2c8d75B9SkxD4ZgX6eHMruWsUZ1djC41N2GaWhKQt3Zuusggcc7XZTvLEhHTKPqvZ_jpHcQ-XrSlptBrJ-z-_S2uw-Vd-tP3snOz-7wPvwZMIOMVRpyFPYSPM9mE3gk8RTbvZh52zFYFr8wzskZjNZ5LmmDNbt2AwKjqrEG0NoueuAB2jh6ivOOUup18nomtILQgJi8uO0Jrn4dHVQsRasGt60efw_eT42-cvMvZikG6kzVI6kqmqsMCQeF2qFHOkw6CuXe1DWucmFJhWXpnUp1lZYJ0o51FrVEWVohq9gC1aLxyAyEpCQZiGPKPo0ihvTI1J7rRDT167cgNQvSSsi0Tl3C_jp11TLLPwLAnPsvDs_QDerYbcdCwdD9182AvMRoNt7FpaA3izukymxvmTahbmd41NCnKPIw5xB_C-V4v1FP9c8OXDC76Cx91GNZcDHcLWcnEXXsMj92t51SyGsP3peDw5H8LmaSGHrX7T-Xz64zd0jgE4
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQcWihFLC1gJLiALBzHieMDQhVQtdp2VUSRejPxI1WldrdstiD6o_iNzOSxK5DorQcOOSV-xP48_sYzngF4UWSZq1Av4V4Viiuvcu5CiesqeqNNMMI51ySb0KNRcXRkDpbgV38Xhtwqe5nYCOow8XRG_kaaBMk3Aejd-TdOWaPIutqn0GhhMYw_f6DKVr_d_YDz-1LK7Y-H73d4l1WA-1SZGffYO1E67WISVCGkyx0-xqnKVyHKKjdRO1kGYWSQWaFdlQgfnFJO6FI6kWK9N-CmSgtN62qo-dxqQTpeY11FyY_MquitqM1VPdSzyE1OcKNEyi__3AcX5PYve2yzzW2v_m8DdA9WOkLNttoVcB-W4ngNVjtyzTrRVa_B3f15gNr6AdgtNp6MOfZ5QtHIGZFt1vaeNT6WgbIetBFLWHVCLgX886cD1ibcZsj02XEbsJvqodLllHW-bmc4sOvw5Vp--iEsY3vxEbCsQJbnZMwz1J6NCMZULsm98i7grlT6AYh-5q3vArFTPpBTuwghTWCxCBZLYLGXA3g1L3LeRiG56uPNHiC2E0i1XaBjAM_nr1GUkH2oHMfJRW0TjeI_JRV-AK97GC6q-GeDj69u8Bnc3jnc37N7u6PhBtxpD-XJ9WkTlmfTi_gEbvnvs5N6-rRZTQy-Xjc6fwOiAF0c
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB61BSE40AdFLBTqSpxAVp2s8_Cxol0VQVdbFarerIztVJVKttpsOfTXM5PHrkAUCfWQi2M7iT1jz-QbfwPwPk8SLMkvkU7nWmqnU4m-IL0KzmTGG4WITbKJbDzOLy7MpMtzWvfR7j0k2Z5pYJamar5_48v95cE38lo46ExJo9VQ3q3CI81x9Oyun50vYAR2uhq4k5ZiMnXyHtb8Wxe_b0xLa_MPgLTZd0brD37jDXjemZzioJWRTVgJ1Rasd-an6JS7pqI-w0NftgXPThasrvULsAeimlaSBHfKFN6CLVTRqopoAhM9pwpoaT5EecU4vDw7nYg2S7Ug81hctizX3A-3LmaiCxD7QR-2Dd9HR98-HcsuQYN0Q23m0tFEqwIzDJHXuYoxRboM6tKVPsRlakKGceGViX2c5BmWkXIetUaVFTGq4UtYo-eFVyCSnEwjjEOakMtplDemxCh12qGnpbxwA1D97FjXsZdzEo1ru-Rd5hG2NMKWR9jeDeDDoslNS93xr8o7_ZTbTotrG5uIHD6WngHsLW6T_jGoUlRhelvbKKM1c8h-7wA-9mKw7OLeB77-r9q78GRyOLJfP4-_vIGn7X9tjh7agbX57Da8hcfu5_yqnr1r5P8XHakF7w
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+non-monotone+line+search+multidimensional+filter-SQP+method+for+general+nonlinear+programming&rft.jtitle=Numerical+algorithms&rft.au=Gu%2C+Chao&rft.au=Zhu%2C+Detong&rft.date=2011-04-01&rft.pub=Springer+Nature+B.V&rft.issn=1017-1398&rft.eissn=1572-9265&rft.volume=56&rft.issue=4&rft.spage=537&rft.epage=559&rft_id=info:doi/10.1007%2Fs11075-010-9403-z
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1017-1398&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1017-1398&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1017-1398&client=summon