A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization

We present a sequential quadratic programming method without using a penalty function or a filter for solving nonlinear equality constrained optimization. In each iteration, the linearized constraints of the quadratic programming are relaxed to satisfy two mild conditions; the step-size is selected...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on optimization Jg. 21; H. 2; S. 545 - 571
Hauptverfasser: Liu, Xinwei, Yuan, Yaxiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.04.2011
Schlagworte:
ISSN:1052-6234, 1095-7189
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present a sequential quadratic programming method without using a penalty function or a filter for solving nonlinear equality constrained optimization. In each iteration, the linearized constraints of the quadratic programming are relaxed to satisfy two mild conditions; the step-size is selected such that either the value of the objective function or the measure of the constraint violations is sufficiently reduced. As a result, our method has two nice properties. First, we do not need to assume the boundedness of the iterative sequence. Second, we do not need any restoration phase which is necessary for filter methods. We prove that the algorithm will terminate at either an approximate Karush-Kuhn-Tucker point, an approximate Fritz-John point, or an approximate infeasible stationary point which is an approximate stationary point for minimizing the [cursive l]2 norm of the constraint violations. By controlling the exactness of the linearized constraints and introducing a second-order correction technique, without requiring linear independence constraint qualification, the algorithm is shown to be locally superlinearly convergent. The preliminary numerical results show that the algorithm is robust and efficient when solving some small- and medium-sized problems from the CUTE collection. [PUBLICATION ABSTRACT]
AbstractList We present a sequential quadratic programming method without using a penalty function or a filter for solving nonlinear equality constrained optimization. In each iteration, the linearized constraints of the quadratic programming are relaxed to satisfy two mild conditions; the step-size is selected such that either the value of the objective function or the measure of the constraint violations is sufficiently reduced. As a result, our method has two nice properties. First, we do not need to assume the boundedness of the iterative sequence. Second, we do not need any restoration phase which is necessary for filter methods. We prove that the algorithm will terminate at either an approximate Karush-Kuhn-Tucker point, an approximate Fritz-John point, or an approximate infeasible stationary point which is an approximate stationary point for minimizing the [cursive l]2 norm of the constraint violations. By controlling the exactness of the linearized constraints and introducing a second-order correction technique, without requiring linear independence constraint qualification, the algorithm is shown to be locally superlinearly convergent. The preliminary numerical results show that the algorithm is robust and efficient when solving some small- and medium-sized problems from the CUTE collection. [PUBLICATION ABSTRACT]
Author Yuan, Yaxiang
Liu, Xinwei
Author_xml – sequence: 1
  givenname: Xinwei
  surname: Liu
  fullname: Liu, Xinwei
– sequence: 2
  givenname: Yaxiang
  surname: Yuan
  fullname: Yuan, Yaxiang
BookMark eNptkL1OwzAUhS1UJNrCwBtYYmII9U_ixGNVtYBUaBEgxsh17OIqtVvHGcrEo-NQxICYzr1X37nSOQPQs84qAC4xusGY5iNUoJzyokhPQB8jniU5LnivmzOSMELTMzBomg1CqOCs6IPPMXxW-1bZYEQNn1pReRGMhEvv1l5st8au4YMK766CbyZKG-AYLpUVdTjAWWtlMM5C56GAM1MH5aGOy6OztbFKeDjdt6I2kZ042wQv4rWCi10wW_MhOu85ONWibtTFjw7B62z6MrlL5ovb-8l4nkiS0ZCsmORUVzlhhNGVoFQqyTDSirBCsVxSiplINdGi0inNFVWUK5FhzvWKE63pEFwd_-68i3mbUG5c62OOpoy9kTwlWZpH6vpISe-axitd7rzZCn8oMSq7gsvfgiM7-sNKE74zdTnrfxxffFuAOA
CitedBy_id crossref_primary_10_1137_140989078
crossref_primary_10_1007_s00186_022_00797_7
crossref_primary_10_1093_imanum_drab097
crossref_primary_10_1137_22M1486303
crossref_primary_10_1080_02331934_2020_1827406
crossref_primary_10_1090_mcom_3799
crossref_primary_10_12677_jast_2024_121008
crossref_primary_10_1007_s10915_024_02495_4
crossref_primary_10_1007_s12190_015_0870_1
crossref_primary_10_1007_s10440_015_0013_6
crossref_primary_10_20965_jrm_2014_p0566
crossref_primary_10_1007_s00186_017_0625_x
crossref_primary_10_1007_s10915_024_02476_7
crossref_primary_10_1007_s11075_022_01475_9
crossref_primary_10_1016_j_amc_2017_08_013
crossref_primary_10_1007_s40305_016_0122_6
crossref_primary_10_1080_00207160_2017_1400663
crossref_primary_10_1016_j_camwa_2012_10_012
crossref_primary_10_1287_moor_2020_1079
crossref_primary_10_1080_10556788_2013_841692
crossref_primary_10_1016_j_apm_2013_05_037
crossref_primary_10_1016_j_cam_2014_12_021
crossref_primary_10_1007_s40305_025_00634_8
crossref_primary_10_1007_s10589_014_9675_7
crossref_primary_10_1007_s10589_019_00117_6
crossref_primary_10_1007_s40314_014_0137_8
crossref_primary_10_1080_10556788_2013_879587
crossref_primary_10_1016_j_apnum_2015_01_009
crossref_primary_10_1007_s10114_018_7063_4
Cites_doi 10.1007/BF01585660
10.1007/s002110050133
10.1007/s10107-005-0701-5
10.1137/S1052623403426556
10.1137/060672285
10.1007/s10107-004-0559-y
10.1007/BF01582294
10.1007/s10107-008-0244-7
10.1016/S0168-9274(02)00119-8
10.1007/s101070100244
10.1007/BF01588787
10.1007/s10107-009-0272-y
10.1007/s10107-003-0376-8
10.1137/S105262340038081X
10.1007/PL00011391
10.1137/S1052623499357258
10.1137/S1064827598334861
10.1007/s10107-007-0136-2
10.1137/S1052623402400641
10.1007/s10107-007-0180-y
10.1007/s10107-003-0378-6
10.1007/s10107-002-0343-9
10.1007/s10107-006-0077-1
10.1007/s10107-003-0477-4
10.1016/S0025-5610(96)00022-6
10.1145/200979.201043
ContentType Journal Article
Copyright Copyright © 2011 Society for Industrial and Applied Mathematics
Copyright_xml – notice: Copyright © 2011 Society for Industrial and Applied Mathematics
DBID AAYXX
CITATION
3V.
7RQ
7WY
7WZ
7X2
7XB
87Z
88A
88F
88I
88K
8AL
8FE
8FG
8FH
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
CCPQU
D1I
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
KB.
L.-
L6V
LK8
M0C
M0K
M0N
M1Q
M2O
M2P
M2T
M7P
M7S
MBDVC
P5Z
P62
PATMY
PDBOC
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
PYCSY
Q9U
U9A
DOI 10.1137/080739884
DatabaseName CrossRef
ProQuest Central (Corporate)
Career & Technical Education Database (ProQuest)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Agricultural Science Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Biology Database (Alumni Edition)
Military Database (Alumni Edition)
Science Database (Alumni Edition)
Telecommunications (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Natural Science Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
Agricultural & Environmental Science Collection
ProQuest Central Essentials - QC
Biological Science Collection
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
Natural Science Collection
ProQuest One
ProQuest Materials Science Collection
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
Materials Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Biological Science Collection
ABI/INFORM Global
Agricultural Science Database
Computing Database
Military Database
Research Library
Science Database
Telecommunications Database
Biological Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Environmental Science Database
Materials Science 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 (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Environmental Science Collection
ProQuest Central Basic
DatabaseTitle CrossRef
Agricultural Science Database
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
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Telecommunications
ProQuest One Applied & Life Sciences
Natural Science Collection
Biological Science Collection
ProQuest Central (New)
Engineering Collection
Career and Technical Education (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest One Academic Eastern Edition
Agricultural Science Collection
ProQuest Technology Collection
ProQuest Telecommunications (Alumni Edition)
Biological Science Database
ProQuest Business Collection
Environmental Science Collection
ProQuest Career and Technical Education
ProQuest One Academic UKI Edition
Environmental Science Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
Materials Science Collection
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Natural Science Collection
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Agricultural & Environmental Science Collection
Materials Science Database
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Materials Science Collection
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Agricultural Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1095-7189
EndPage 571
ExternalDocumentID 3009048291
10_1137_080739884
GroupedDBID -~X
.4S
.DC
123
4.4
7RQ
7WY
7X2
7XC
88I
8CJ
8FE
8FG
8FH
8FL
8G5
8V8
AALVN
AASXH
AAYXX
ABDBF
ABDPE
ABJCF
ABKAD
ABMZU
ABUWG
ACGFO
ACGOD
ACIWK
ACPRK
ACUHS
ADBBV
AEMOZ
AENEX
AFFHD
AFFNX
AFKRA
AFRAH
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ANXRF
ARAPS
ARCSS
ATCPS
AZQEC
BBNVY
BENPR
BEZIV
BGLVJ
BHPHI
BPHCQ
CCPQU
CITATION
CS3
CZ9
D1I
D1J
D1K
DQ2
DU5
DWQXO
EAP
EBR
EBS
EBU
EDO
EJD
EMK
EST
ESX
F5P
FRNLG
GNUQQ
GUQSH
H13
HCIFZ
H~9
I-F
K1G
K6-
K60
K6V
K6~
K7-
KB.
KC.
L6V
LK5
LK8
M0C
M0K
M1Q
M2O
M2P
M7P
M7R
M7S
P1Q
P2P
P62
PATMY
PDBOC
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PTHSS
PYCSY
RJG
RNS
RSI
TH9
TN5
TUS
TWZ
YNT
3V.
7XB
88A
88K
8AL
8FK
JQ2
L.-
M0N
M2T
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
U9A
ID FETCH-LOGICAL-c253t-b6c93fd726263ba33cec610fe268e67c3316a4f2fadf437e3e39ea5199fb92ff3
IEDL.DBID M7S
ISICitedReferencesCount 43
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000292247200006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1052-6234
IngestDate Sun Jul 13 05:12:34 EDT 2025
Tue Nov 18 22:06:22 EST 2025
Sat Nov 29 06:10:57 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c253t-b6c93fd726263ba33cec610fe268e67c3316a4f2fadf437e3e39ea5199fb92ff3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1372742547
PQPubID 666300
PageCount 27
ParticipantIDs proquest_journals_1372742547
crossref_primary_10_1137_080739884
crossref_citationtrail_10_1137_080739884
PublicationCentury 2000
PublicationDate 20110401
PublicationDateYYYYMMDD 2011-04-01
PublicationDate_xml – month: 04
  year: 2011
  text: 20110401
  day: 01
PublicationDecade 2010
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle SIAM journal on optimization
PublicationYear 2011
Publisher Society for Industrial and Applied Mathematics
Publisher_xml – name: Society for Industrial and Applied Mathematics
References R21
R20
R23
R25
R24
R27
R29
R28
R1
R2
R3
R4
R5
R7
R8
R9
R30
R31
R12
R33
R14
R13
R16
R15
R17
R19
References_xml – ident: R16
  doi: 10.1007/BF01585660
– ident: R33
  doi: 10.1007/s002110050133
– ident: R8
  doi: 10.1007/s10107-005-0701-5
– ident: R29
  doi: 10.1137/S1052623403426556
– ident: R24
  doi: 10.1137/060672285
– ident: R30
  doi: 10.1007/s10107-004-0559-y
– ident: R4
  doi: 10.1007/BF01582294
– ident: R17
  doi: 10.1007/s10107-008-0244-7
– ident: R15
  doi: 10.1016/S0168-9274(02)00119-8
– ident: R13
  doi: 10.1007/s101070100244
– ident: R23
  doi: 10.1007/BF01588787
– ident: R21
  doi: 10.1007/s10107-009-0272-y
– ident: R7
  doi: 10.1007/s10107-003-0376-8
– ident: R14
  doi: 10.1137/S105262340038081X
– ident: R5
  doi: 10.1007/PL00011391
– ident: R12
  doi: 10.1137/S1052623499357258
– ident: R20
  doi: 10.1137/S1064827598334861
– ident: R2
  doi: 10.1007/s10107-007-0136-2
– ident: R19
  doi: 10.1137/S1052623402400641
– ident: R25
  doi: 10.1007/s10107-007-0180-y
– ident: R9
  doi: 10.1007/s10107-003-0378-6
– ident: R27
  doi: 10.1007/s10107-002-0343-9
– ident: R1
  doi: 10.1007/s10107-006-0077-1
– ident: R28
  doi: 10.1007/s10107-003-0477-4
– ident: R31
  doi: 10.1016/S0025-5610(96)00022-6
– ident: R3
  doi: 10.1145/200979.201043
SSID ssj0008968
Score 2.1702812
Snippet We present a sequential quadratic programming method without using a penalty function or a filter for solving nonlinear equality constrained optimization. In...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 545
SubjectTerms Algorithms
Applied mathematics
Computational mathematics
Mathematical functions
Methods
Optimization
Quadratic programming
Violations
Title A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
URI https://www.proquest.com/docview/1372742547
Volume 21
WOSCitedRecordID wos000292247200006&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: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: 7WY
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M0C
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: P5Z
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Agricultural Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M0K
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/agriculturejournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Biological Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M7P
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/biologicalscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Career & Technical Education Database (ProQuest)
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: 7RQ
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/career
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: K7-
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M7S
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Environmental Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: PATMY
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/environmentalscience
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Materials Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: KB.
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/materialsscijournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Military Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M1Q
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/military
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: BENPR
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M2O
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1095-7189
  dateEnd: 20140731
  omitProxy: false
  ssIdentifier: ssj0008968
  issn: 1052-6234
  databaseCode: M2P
  dateStart: 19910201
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fb9MwELbYxgM88HtiMKYT4oGXQGM7sfOEuqkV0tQuW4c2eIkc25Eqbe1oU6S98adz57iFSYgXXr7EiqNYOvt88d19x9g7j0vG8NQlmc10IimJq_BSJ3UujbQit9o0odiEGo_15WVRxgO3ZQyrXOvEoKjd3NIZ-cdUKPIqZlJ9uvmeUNUo8q7GEhpbbIdYEtIQujfZaGJdxFS4jCe4zcvILJQSp48mF5XW8u5-dFcdhz1m-Ph_R_eEPYrWJfS76fCU3fOzZ-zhH5yD2BptiFqXz9nPPkxCMDUu9Cs4XRlHM8JC2YVtXeMrMApFpuFiipdVC30oPX6kvYUh7okkV5gvwMBwSo53QCMYxh3_hlnAoEvavAUqDBrKUXgHJ6imrmP-5wv2ZTg4P_qcxKIMieWZaFGIthCNU5xobGojhPUWTbDG81z7XFkh0tzIhjfGNVIoL7wovEE7sWjqgjeN2GXbs_nMv2SAplhd90zqej6XymkiijHG8Fqh2eKyfI-9X4umspGxnEZ6VYU_F6GqjRT32NtN15uOpuNvnfbXwqviSl1WvyX36t-PX7MH3XkyRe3ss-12sfJv2H37o50uFwdsS52dEl58PWA7h4NxeYatY5UQHn5AHPWOAh4TptR3xE8ClgHPCVW4VxPEMvv2C1VV77c
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VFgk48CqIQikjBBKXiI3txM4BoVXbVat2ly0Utbfg-CGt1O6W3Sxob_wifiPjPLathLj1wCmK4iSW8-Xz2DPzDcAbR7-MZrGNEpOoSIQkrswJFRWp0MLw1Cjtq2ITcjBQp6fZcAV-t7kwIayy5cSKqO3EhD3y9zGXwauYCPnx4nsUqkYF72pbQqOGxYFb_KQl2-zD_g5937eM9XaPt_eipqpAZFjCS-qFybi3kgUdlkJzbpwhG8I7liqXSsN5nGrhmdfWCy4ddzxzmgydzBcZ857Tc2_BGvF4J4SQyc9HS-ZXWZN6l7CIzArRKBnFQUNIBZeYUuL6_Hed_qs5rffgfxuNh3C_sZ6xW8P9Eay48WO4d0VTkc76SyHa2Tr86uKXKliciOwMj-baBsQbHNZhaed0C_arItp4MqLDvMQuDh29pFxgj-b8gFucTFFjbxQCC5CMfBzU-iJ6irt1UuoCQ-HTqtyGs_iJaPi8yW99Al9vZECewup4MnbPAMnULIqOjm3HpUJaFYRwtNaskGSW2STdgHctFHLTKLKHnp7l1cqMy3yJmg14vWx6UcuQ_K3RZguWvGGiWX6JlOf_vvwK7uwd9w_zw_3BwQu4W--dhwilTVgtp3P3Em6bH-VoNt2qQI_w7aZx9QdEqUGB
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+Sequential+Quadratic+Programming+Method+Without+A+Penalty+Function+or+a+Filter+for+Nonlinear+Equality+Constrained+Optimization&rft.jtitle=SIAM+journal+on+optimization&rft.au=Liu%2C+Xinwei&rft.au=Yuan%2C+Yaxiang&rft.date=2011-04-01&rft.issn=1052-6234&rft.eissn=1095-7189&rft.volume=21&rft.issue=2&rft.spage=545&rft.epage=571&rft_id=info:doi/10.1137%2F080739884&rft.externalDBID=n%2Fa&rft.externalDocID=10_1137_080739884
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1052-6234&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1052-6234&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1052-6234&client=summon