The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Non-Linear Programming Via Penalty Functions
Abstract
The non-linear programming problem seeks to maximize a function f(x) where the n component vector x must satisfy certain constraints g i(x) = 0, i = 1, …, m 1 and g i(z) ≧ 0, i = m 1 + 1, …, m. The algorithm presented in this paper solves the non-linear programming problem by transforming it into a sequence of unconstrained maximization problems. Essentially, a penalty is imposed whenever x does not satisfy the constraints. Although the algorithm appears most useful in the concave case, the convergence proof holds for non-concave functions as well. The algorithm is especially interesting in the concave case because the programming problem reduces to a single unconstrained maximization problem or, at most, to a finite sequence of unconstrained maximization problems. In addition, the paper presents a new class of dual problems, and the algorithm is shown to be a dual feasible method. Another property of the algorithm is that it appears particularly well suited for large-scale problems with a sizable number of constraints.
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.
Integrity signals
Registry
Cites
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.
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
The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
Carroll, C. W. (1961) · Operations Research · doi:10.1287/opre.9.2.169 · Cited by 313
A Review of Minimization Techniques for Nonlinear Functions
Spang, H. A. (1962) · SIAM Review · doi:10.1137/1004089 · Cited by 162
Cited by
Variable structure systems with sliding modes
Utkin, V. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101446 · Cited by 5,367
An Adaptive Nonlinear Least-Squares Algorithm
Dennis, J. E., Gay, D. M., & Walsh, R. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355958.355965 · Cited by 930
Algorithms for the Solution of the Nonlinear Least-Squares Problem
Gill, P. E., & Murray, W. (1978) · SIAM Journal on Numerical Analysis · doi:10.1137/0715063 · Cited by 556
Error bounds in mathematical programming
Pang, J.-S. (1997) · Mathematical Programming · doi:10.1007/bf02614322 · Cited by 441
Guaranteed Matrix Completion via Non-Convex Factorization
Sun, R., & Luo, Z.-Q. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2598574 · Cited by 309
Metadata
- Authors
- Zangwill, W. I.
- Venue
- Management Science
- Published
- 1967-01
- Volume
- 13
- Issue
- 5
- Pages
- 344-358
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W1976086748
- Cited by
- 511
- References
- 2
- FWCI
- 6.97
- 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.