The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
Abstract
Previous article Next article The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear ConstraintsJ. B. RosenJ. B. Rosenhttps://doi.org/10.1137/0109044PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] V. N. Faddeeva, Computational methods of linear algebra, Dover Publications Inc., New York, 1959, 59– MR0100344 0086.10802 Google Scholar[2] J. E. Kelley, Jr., The cutting-plane method for solving convex programs, J. Soc. Indust. Appl. Math., 8 (1960), 703–712 10.1137/0108053 MR0118538 0098.12104 LinkISIGoogle Scholar[3] J. B. Rosen, The gradient projection method for nonlinear programming. I. Linear constraints, J. Soc. Indust. Appl. Math., 8 (1960), 181–217 10.1137/0108011 MR0112750 0099.36405 LinkISIGoogle Scholar[4] J. B. Rosen, The gradient projection method for nonlinear programming. Part II. Non-linear constraints, Presented at RAND Symposium on Mathematical Programming, 1959, March Google Scholar[5] J. B. Rosen, Stability of differential equations and equivalent nonlinear programming problem, Notices Amer. Math. Soc., 7 (1960), 996– Google Scholar[6] Peter Wegner, A non-linear extension of the simplex method, Management. Sci., 7 (1960/1961), 43–55 MR0115828 0995.90624 CrossrefISIGoogle Scholar[7] G. Zoutendijk, Methods of feasible directions: A study in linear and non-linear programming, Elsevier Publishing Co., Amsterdam-London-New York-Princeton, N.J., 1960ii+127 MR0129119 0097.35408 Google Scholar[8] H. W. Kuhn and , A. W. Tucker, Nonlinear programming, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, 1950, University of California Press, Berkeley and Los Angeles, 1951, 481–492 MR0047303 0044.05903 Google Scholar[9] O. L. Mangasarian, Equivalence of the Kuhn-Tucker and gradient projection conditions for constrained maxima, to be published Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Riemannian Multigrid Line Search for Low-Rank ProblemsMarco Sutti and Bart Vandereycken20 May 2021 | SIAM Journal on Scientific Computing, Vol. 43, No. 3AbstractPDF (1015 KB)A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive ControlGiampaolo Torrisi, Sergio Grammatico, Roy S. Smith, and Manfred Morari31 May 2018 | SIAM Journal on Control and Optimization, Vol. 56, No. 3AbstractPDF (641 KB)Modulus Methods for Nonnegatively Constrained Image Restoration30 August 2016 | SIAM Journal on Imaging Sciences, Vol. 9, No. 3AbstractPDF (669 KB)Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints20 June 2013 | SIAM Journal on Optimization, Vol. 23, No. 2AbstractPDF (447 KB)An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints7 October 2010 | SIAM Journal on Optimization, Vol. 20, No. 6AbstractPDF (336 KB)Dynamic Control of Infeasibility in Equality Constrained Optimization19 November 2008 | SIAM Journal on Optimization, Vol. 19, No. 3AbstractPDF (319 KB)Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal25 July 2006 | SIAM Journal on Scientific Computing, Vol. 22, No. 2AbstractPDF (884 KB)Sliding Modes in Solving Convex Programming Problems26 July 2006 | SIAM Journal on Control and Optimization, Vol. 36, No. 2AbstractPDF (712 KB)Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes1 August 2006 | SIAM Journal on Control and Optimization, Vol. 19, No. 3AbstractPDF (2616 KB)On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 15, No. 4AbstractPDF (2118 KB)Efficiently Converging Minimization Methods Based on the Reduced Gradient3 August 2006 | SIAM Journal on Control and Optimization, Vol. 14, No. 1AbstractPDF (1951 KB)An Arc Method for Nonlinear Programming18 July 2006 | SIAM Journal on Control, Vol. 13, No. 6AbstractPDF (2307 KB)Constrained Optimization Using a Nondifferentiable Penalty Function14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 4AbstractPDF (1833 KB)Best Summation Formulae and Discrete Splines14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 3AbstractPDF (1020 KB)An Historical Survey of Computational Methods in Optimal Control2 August 2006 | SIAM Review, Vol. 15, No. 2AbstractPDF (3413 KB)A Convergence Theory for a Class of Nonlinear Programming Problems14 July 2006 | SIAM Journal on Numerical Analysis, Vol. 10, No. 1AbstractPDF (2034 KB)On the Convergence of the Conjugate Gradient Method for Singular Linear Operator Equations1 August 2006 | SIAM Journal on Numerical Analysis, Vol. 9, No. 1AbstractPDF (1764 KB)On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming18 July 2006 | SIAM Journal on Control, Vol. 5, No. 2AbstractPDF (1369 KB)A Ricoch
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
Computational Methods of Linear Algebra
H., A. S., Faddeev, D. K., & Faddeeva, V. N. (1964) · Mathematics of Computation · doi:10.2307/2003785 · Cited by 1,599
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
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Rosen, J. B. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108011 · Cited by 1,190
Self-citation
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
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
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Rosen, J. B. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108011 · Cited by 1,190
Self-citationTotal variation based image restoration with free local constraints
Rudin, L. I., & Osher, S. (2002) · Proceedings of 1st International Conference on Image Processing · doi:10.1109/icip.1994.413269 · Cited by 673
Metadata
- Authors
- Rosen, J. B.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1961-12
- Volume
- 9
- Issue
- 4
- Pages
- 514-532
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2264885058
- Cited by
- 520
- References
- 3
- FWCI
- 6.24
- 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: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints. https://app.cochat.ai/papers/10.1137/0109044
- The paper
- Rosen, J. B. (1961). The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints. Journal of the Society for Industrial and Applied Mathematics. https://doi.org/10.1137/0109044
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.