The DOI matches its Crossref record.
Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
Abstract
We study mathematical programs with complementarity constraints. Several stationarity concepts, based on a piecewise smooth formulation, are presented and compared. The concepts are related to stationarity conditions for certain smooth programs as well as to stationarity concepts for a nonsmooth exact penalty function. Further, we present Fiacco-McCormick type second order optimality conditions and an extension of the stability results of Robinson and Kojima to mathematical programs with complementarity constraints.
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
Cited by
Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
Fletcher, R., Leyffer, S., Ralph, D., & Scholtes, S. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623402407382 · Cited by 266
Self-citationEmbedded nonlinear model predictive control for obstacle avoidance using PANOC
Sathya, A., Sopasakis, P., Van Parys, R., Themelis, A., Pipeleers, G., & Patrinos, P. (2018) · 2018 European Control Conference (ECC) · doi:10.23919/ecc.2018.8550253 · Cited by 105
OpEn: Code Generation for Embedded Nonconvex Optimization
Sopasakis, P., Fresk, E., & Patrinos, P. (2020) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2020.12.071 · Cited by 91
Metadata
- Authors
- Scheel, H., & Scholtes, S.
- Venue
- Mathematics of Operations Research
- Published
- 2000-02
- Volume
- 25
- Issue
- 1
- Pages
- 1-22
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2037678919
- Cited by
- 667
- References
- 0
- FWCI
- 9.90
- 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: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. https://app.cochat.ai/papers/10.1287/moor.25.1.1.15213
- The paper
- Scheel, H., & Scholtes, S. (2000). Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity. Mathematics of Operations Research. https://doi.org/10.1287/moor.25.1.1.15213
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.
