A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory

DOI10.1137/0329062MaRDI QIDQ3363099zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

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

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

zbMATH Keywords

convergenceFréchet differentiable functionHilbert spacescaled gradient projection methods

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Methods of reduced gradient type (90C52)

Recommendations

• On a certain continuous minimization method with a variable metric
• Strong convergence of a projected gradient method
• A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory
• scientific article; zbMATH DE number 4101955
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization

Cited in

(4)

• Error bounds and convergence analysis of feasible descent methods: A general approach
• On a certain continuous minimization method with a variable metric
• Global convergence of a modified gradient projection method for convex constrained problems
• A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory

This page was built for publication: A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Global Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3363099)