The Gradient Projection Method Using Curry’s Steplength

DOI10.1137/0324042zbMath0603.90117OpenAlexW1991962786MaRDI QIDQ3741449

Robert R. Phelps

Publication date: 1986

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0324042

zbMATH Keywords

Hilbert spacecluster pointgradient projection methodorthogonal polyhedraconstrained stationary pointsCurry steplength

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Programming in abstract spaces (90C48)

Related Items

Paths to constrained Nash equilibria ⋮ Continuous gradient projection method in Hilbert spaces ⋮ Projected gradient methods for linearly constrained problems ⋮ Global convergence of a modified gradient projection method for convex constrained problems ⋮ Inequalities characterizing coisotone cones in Euclidean spaces ⋮ Parallel two-phase methods for global optimization on GPU ⋮ On finite convergence and constraint identification of subgradient projection methods