On the Identification Property of a Projected Gradient Method

DOI10.1137/0730077zbMath0802.65080OpenAlexW2026951624MaRDI QIDQ3142639

Gerardo Toraldo, Pasquale L. De Angelis

Publication date: 11 December 1994

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

convergenceprojected gradient methodactive setfinite identificationconvex feasible region

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (9)

On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems ⋮ An accurate active set conjugate gradient algorithm with project search for bound constrained optimization ⋮ A projected gradient trust-region method for solving nonlinear systems with convex constraints ⋮ An efficient gradient method using the Yuan steplength ⋮ A generalized eigenvalues classifier with embedded feature selection ⋮ Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Semi-supervised generalized eigenvalues classification ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches

This page was built for publication: On the Identification Property of a Projected Gradient Method