The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Abstract
more constraints or equations, with either a linear or nonlinear objective function. This distinction is made primarily on the basis of the difficulty of solving these two types of nonlinear problems. The first type is the less difficult of the two, and in this, Part I of the paper, it is shown how it is solved by the gradient projection method. It should be noted that since a linear objective function is a special case of a nonlinear objective function, the gradient projection method will also solve a linear programming problem. In Part II of the paper [16], the extension of the gradient projection method to the more difficult problem of nonlinear constraints and equations will be described. The basic paper on linear programming is the paper by Dantzig [5] in which the simplex method for solving the linear programming problem is presented. The nonlinear programming problem is formulated and a necessary and sufficient condition for a constrained maximum is given in terms of an equivalent saddle value problem in the paper by Kuhn and Tucker [10]. Further developments motivated by this paper, including a computational procedure, have been published recently [1]. The gradient projection method was originally presented to the American Mathematical Society
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
A generalized inverse for matrices
Penrose, R. (1955) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100030401 · Cited by 4,551
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Rosen, J. B. (1961) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0109044 · Cited by 520
Self-citationThe Simplex Method for Quadratic Programming
Wolfe, P. (1960) · Econometrica · doi:10.2307/1905320 · Cited by 503
The method of steepest descent for non-linear minimization problems
Curry, H. B. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10667 · Cited by 437
Some Applications of the Pseudoinverse of a Matrix
Greville, T. N. E. (1960) · SIAM Review · doi:10.1137/1002004 · Cited by 352
Maximizing a Function in a Convex Region
Zoutendijk, G. (1959) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1959.tb00341.x · Cited by 40
Cited by
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
An algorithm for linearly constrained adaptive array processing
Frost, O. L. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8817 · Cited by 2,533
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
A New Method of Constrained Optimization and a Comparison With Other Methods
Box, M. J. (1965) · The Computer Journal · doi:10.1093/comjnl/8.1.42 · Cited by 1,302
Metadata
- Authors
- Rosen, J. B.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1960-03
- Volume
- 8
- Issue
- 1
- Pages
- 181-217
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2143101939
- Cited by
- 1,190
- References
- 7
- FWCI
- 14.79
- 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.