The Gradient Projection Method under Mild Differentiability Conditions
Authors:
- G. P. McCormickGMG. P. McCormick
- R. A. TapiaRTR. A. Tapia
- 1 February 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control
- Vol. 10 (1) , 93-98
Abstract
Consider the sequence obtained by applying the gradient projection method to the problem of minimizing a continuously differentiable functional over a closed convex subset of a real Hilbert space. In this paper we show that any cluster point of this sequence must be a constrained stationary point.Keywords
This publication has 10 references indexed in Scilit:
- The Differentiation and Integration of Nonlinear Operators1971
- Invertibly positive linear operators on spaces of continuous functionsMathematische Annalen, 1969
- Convergence Conditions for Ascent MethodsSIAM Review, 1969
- Two convex counterexamples: A discontinuous envelope function and a nondifferentiable nearest-point mappingProceedings of the American Mathematical Society, 1969
- Communications to the Editor—Exponential Forecasting: Some New VariationsManagement Science, 1969
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1960
- The method of steepest descent for non-linear minimization problemsQuarterly of Applied Mathematics, 1944
- Zur Theorie der nichtlinearen Integralgleichungen, Integralgleichungssysteme und allgemeinen FunktionalgleichungenMathematische Zeitschrift, 1935