The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
Abstract
A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary implementation has been tested and some promising numerical results are reported.
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
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
An Introduction to Signal Detection and Estimation
Poor, H. V. (1988) · Springer Texts in Electrical Engineering · doi:10.1007/978-1-4757-3863-6 · Cited by 3,149
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
An Interior Point Algorithm for Large-Scale Nonlinear Programming
Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497325107 · Cited by 1,739
A fast algorithm for nonlinearly constrained optimization calculations
Powell, M. J. D. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067703 · Cited by 1,661
A trust region method based on interior point techniques for nonlinear programming
Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000) · Mathematical Programming · doi:10.1007/pl00011391 · Cited by 1,638
Maciejowski, J. M. (1989) · Cited by 1,523
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
Cited by
Generalizing Surrogate-Assisted Evolutionary Computation
Lim, D., Jin, Y., Ong, Y.-S., & Sendhoff, B. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2027359 · Cited by 484
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
Volatility transmission in emerging European foreign exchange markets
Bubák, V., Kočenda, E., & Žikeš, F. (2011) · Journal of Banking & Finance · doi:10.1016/j.jbankfin.2011.03.012 · Cited by 337
Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
Scutari, G., Facchinei, F., & Lampariello, L. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2637317 · Cited by 314
Sequential quadratic programming for large-scale nonlinear optimization
Boggs, P. T., & Tolle, J. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00429-5 · Cited by 283
Metadata
- Authors
- Lawrence, C. T., & Tits, A. L.
- Venue
- SIAM Journal on Optimization
- Published
- 2001-01
- Volume
- 11
- Issue
- 4
- Pages
- 1092-1118
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2156762405
- Cited by
- 275
- References
- 32
- FWCI
- 11.49
- 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: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. https://app.cochat.ai/papers/10.1137/s1052623498344562
- The paper
- Lawrence, C. T., & Tits, A. L. (2001). A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623498344562
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.