CoChat

On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Function

Schittkowski, Klaus · 1983 · Mathematische Operationsforschung und Statistik. Series Optimization
Cited by 243

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

Sequential quadratic programming methods as developed by Wilson, Han, and Powell have gained considerable attention in the last few years mainly because of their outstanding numerical performance. Although the theoretical convergence aspects of this method and its various modifications have been investigated in the literature, there still remain some open questions which will be treated in this paper. The convergence theory to be presented, takes into account the additional variable introduced in the quadratic programming subproblem to avoid inconsistency, the one-dimensional minimization procedure, and, in particular, an “ active set” strategy to avoid the recalculation of unnecessary gradients. This paper also contains a detailed mathematical description of a nonlinear programming algorithm which has been implemented by the author. the usage of the code and detailed numerical test results are presented in [5].

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/02331938308842847

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Cited by

See all 243

Metadata

Authors
Schittkowski, K.
Venue
Mathematische Operationsforschung und Statistik. Series Optimization
Published
1983-01
Volume
14
Issue
2
Pages
197-216
ISSN
0323-3898 (ISSN-L)
OpenAlex
W2005411772
Cited by
243
References
1
FWCI
9.01
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: On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Function. https://app.cochat.ai/papers/10.1080/02331938308842847
The paper
Schittkowski, K. (1983). On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Function. Mathematische Operationsforschung und Statistik. Series Optimization. https://doi.org/10.1080/02331938308842847

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.