The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
Abstract
Recently, nonlinear programming solvers have been used to solve a range of mathematical programs with equilibrium constraints (MPECs). In particular, sequential quadratic programming (SQP) methods have been very successful. This paper examines the local convergence properties of SQP methods applied to MPECs. SQP is shown to converge superlinearly under reasonable assumptions near a strongly stationary point. A number of examples are presented that show that some of the assumptions are difficult to relax.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Mathematical Programs with Equilibrium Constraints
Luo, Z.-Q., Pang, J.-S., & Ralph, D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511983658 · Cited by 1,963
Self-citationSNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Engineering and Economic Applications of Complementarity Problems
Ferris, M. C., & Pang, J. S. (1997) · SIAM Review · doi:10.1137/s0036144595285963 · Cited by 1,081
Nonlinear programming without a penalty function
Fletcher, R., & Leyffer, S. (2002) · Mathematical Programming · doi:10.1007/s101070100244 · Cited by 874
Self-citationMathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Scheel, H., & Scholtes, S. (2000) · Mathematics of Operations Research · doi:10.1287/moor.25.1.1.15213 · Cited by 667
Self-citationRobinson, S. M. (1974) · Mathematical Programming · doi:10.1007/bf01585500 · Cited by 254
Scholtes, S., & Stöhr, M. (2001) · Mathematics of Operations Research · doi:10.1287/moor.26.4.851.10007 · Cited by 81
Self-citationNumerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1996) · Mathematical Programming · doi:10.1007/bf02592099 · Cited by 53
Cited by
A direct method for trajectory optimization of rigid bodies through contact
Posa, M., Cantu, C., & Tedrake, R. (2014) · The International Journal of Robotics Research · doi:10.1177/0278364913506757 · Cited by 597
Metadata
- Authors
- Fletcher, R., Leyffer, S., Ralph, D., & Scholtes, S.
- Venue
- SIAM Journal on Optimization
- Published
- 2006-01
- Volume
- 17
- Issue
- 1
- Pages
- 259-286
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2171126500
- Cited by
- 266
- References
- 9
- FWCI
- 18.45
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints. https://app.cochat.ai/papers/10.1137/s1052623402407382
- The paper
- Fletcher, R., Leyffer, S., Ralph, D., & Scholtes, S. (2006). Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623402407382
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
