A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory
- 1 September 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 29 (5) , 1160-1175
- https://doi.org/10.1137/0329062
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalitiesApplied Mathematics & Optimization, 1988
- On the convergence of projected gradient processes to singular critical pointsJournal of Optimization Theory and Applications, 1987
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient ProcessesSIAM Journal on Control and Optimization, 1981
- On the Goldstein-Levitin-Polyak gradient projection methodIEEE Transactions on Automatic Control, 1976
- The Gradient Projection Method under Mild Differentiability ConditionsSIAM Journal on Control, 1972
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964