Convergence of subspace gradient method

MaRDI QIDQ5476382zbMATH OpenFDO

Authors Jie Shen, Zhenjun Shi

Publication date 14 July 2006

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Recommendations

• The convergence of subspace trust region methods
• Convergence analysis of adaptive trust region methods
• Subspace trust-region algorithm with conic model for unconstrained optimization
• Convergence of supermemory gradient method
• A subspace implementation of quasi-Newton trust region methods for unconstrained optimization

Cited in

(4)

• A Subspace Decomposition Principle for Scaled Gradient Projection Methods: Local Theory
• Modified Active Subspaces Using the Average of Gradients
• Convergence of a subgradient method for computing the bound norm of matrices
• Consistency and convergence rate for nearest subspace classifier

This page was built for publication: Convergence of subspace gradient method

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