The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Exact penalty functions in nonlinear programming
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
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 1×
“unconstrained optimization of piecewise differentiable functions [2, 3, 5, 17, 20-23 ,26,30], although only Conn [5] and Merrill [20] have capitalized on the piecewise differentiability.”
BackgroundMangasarian, O. L. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971255 · Cited by 3,220
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
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
Minima of Functions of Several Variables with Inequalities as Side Conditions
Karush, W. (2014) · Traces and Emergence of Nonlinear Programming · doi:10.1007/978-3-0348-0439-4_10 · Cited by 848
Mangasarian, O. L., & Fromovitz, S. (1967) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(67)90163-1 · Cited by 622
THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS
Powell, M. J. D. (1978) · Nonlinear Programming 3 · doi:10.1016/b978-0-12-468660-1.50007-4 · Cited by 541
Non-Linear Programming Via Penalty Functions
Zangwill, W. I. (1967) · Management Science · doi:10.1287/mnsc.13.5.344 · Cited by 511
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Han, S.-P. (1976) · Mathematical Programming · doi:10.1007/bf01580395 · Cited by 477
Cited by
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
Model Predictive Control for Vehicle Stabilization at the Limits of Handling
Beal, C. E., & Gerdes, J. C. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2200826 · Cited by 465
Metadata
- Authors
- Evans, J. P., Gould, F. J., & Tolle, J. W.
- Venue
- Mathematical Programming
- Published
- 1973-12
- Volume
- 4
- Issue
- 1
- Pages
- 72-97
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2003140178
- Cited by
- 304
- References
- 13
- FWCI
- 5.59
- 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.