An improved three-dimensional subspace minimization conjugate gradient method

DOI10.13413/J.CNKI.JDXBLXB.2019329MaRDI QIDQ3385871zbMATH OpenFDO

Authors

Publication date 14 January 2021

zbMATH Keywords

global convergenceconjugate gradient methodlarge-scale unconstrained optimizationWolfe line searchmodified secant equation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization
• An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization
• A subspace conjugate gradient algorithm for large-scale unconstrained optimization
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
• scientific article; zbMATH DE number 641552

Cited in

(2)

• An alternative three-dimensional subspace method based on conic model for unconstrained optimization
• A New Adaptive Subspace Minimization Three-Term Conjugate Gradient Algorithm for Unconstrained Optimization

This page was built for publication: An improved three-dimensional subspace minimization conjugate gradient method

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