The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
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
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 10,358
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Numerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
A simplicial algorithm for concave programming
Wilson, R. B. (1963) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 289
On the continuity of the minimum set of a continuous function
Dantzig, G. B., Folkman, J., & Shapiro, N. (1967) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(67)90139-4 · Cited by 244
A quadratically-convergent algorithm for general nonlinear programming problems
Robinson, S. M. (1972) · Mathematical Programming · doi:10.1007/bf01584986 · Cited by 191
Self-citation
Cited by
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
A globally convergent method for nonlinear programming
Han, S. P. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932858 · Cited by 1,097
A special newton-type optimization method
Fischer, A. (1992) · Optimization · doi:10.1080/02331939208843795 · Cited by 762
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Han, S.-P. (1976) · Mathematical Programming · doi:10.1007/bf01580395 · Cited by 477
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
Lawrence, C. T., & Tits, A. L. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623498344562 · Cited by 275
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
Metadata
- Authors
- Robinson, S. M.
- Venue
- Mathematical Programming
- Published
- 1974-12
- Volume
- 7
- Issue
- 1
- Pages
- 1-16
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2002443028
- Cited by
- 254
- References
- 12
- FWCI
- 2.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
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.