The Gradient Projection Method Using Curry’s Steplength
Author:
- R. P. PhelpsRPR. P. Phelps
- 1 July 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 24 (4) , 692-699
Abstract
It is shown that, using Curry’s steplength, the gradient projection method for finding constrained stationary points of a real valued $C^1 $ function on a closed convex subset C of Hilbert space can work for two rather different classes of convex sets: those with $C^2 $ boundary and “orthogonal polyhedra”. Both results are applications of Theorem 1, whose hypotheses require that the metric projection onto C possess directional derivatives which are continuous in a rather weak sense.
Keywords
This publication has 10 references indexed in Scilit:
- Metric Projections and the Gradient Projection Method in Banach SpacesSIAM Journal on Control and Optimization, 1985
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- Differentiability of the metric projection in Hilbert spaceTransactions of the American Mathematical Society, 1982
- Differential Analysis1980
- Contrôle dans les inéquations variationelles elliptiquesJournal of Functional Analysis, 1976
- An extension of Curry's theorem to steepest descent in normed linear spacesMathematical Programming, 1975
- Smoothness of certain metric projections on Hilbert spaceTransactions of the American Mathematical Society, 1973
- The Gradient Projection Method under Mild Differentiability ConditionsSIAM Journal on Control, 1972
- Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory1971
- Two convex counterexamples: A discontinuous envelope function and a nondifferentiable nearest-point mappingProceedings of the American Mathematical Society, 1969